Cristian Calude - researchr alias

researchr

You are not signed in
Sign in
Sign up

Viewing Publication 1 - 70 from 70

2013

Discrete mathematical structures: From dynamics to complexityCristian Calude, Bruno Durand, Anahí Gajardo, Dominique Perrin, Ivan Rapaport, Sergio Rica. TCS, 504:3-4, 2013. [doi]

2012

News from New ZealandCristian Calude. eatcs, 107:29-40, 2012. [doi]

2011

An Interview with Erol Gelenbe: Practical Theories Make the World Go (Part II)Cristian Calude. ubiquity, 2011(January):4, 2011. [doi]

2010

An Interview with Erol GelenbeCristian Calude. ubiquity, 2010(December):3, 2010. [doi]

2008

Incompleteness: A Personal PerspectiveCristian Calude. dcfs 2008: 14-24

2005

Proving as a Computable ProcedureCristian Calude, Sergiu Rudeanu. FUIN, 64(1-4):43-52, 2005. [doi]

PrefaceCristian Calude. ijfcs, 16(4):623-624, 2005. [doi]

2004

2003

A topological characterization of random sequencesCristian Calude, Solomon Marcus, Ludwig Staiger. ipl, 88(5):245-250, 2003. [doi]

What is the Value of Taxicab(6)?Cristian Calude, Elena Calude, Michael J. Dinneen. jucs, 9(10):1196-1203, 2003. [doi]

2002

Bead-Sort: A Natural Sorting AlgorithmJoshua J. Arulanandham, Cristian Calude, Michael J. Dinneen. eatcs, 76:153-161, 2002.

A characterization of c.e. random realsCristian Calude. TCS, 271(1-2):3-14, 2002. [doi]

Chaitin Omega numbers, Solovay machines, and Gödel incompletenessCristian Calude. TCS, 284(2):269-277, 2002. [doi]

The Bridge Crossing ProblemCristian Calude, Elena Calude. eatcs, 77:180-190, 2002.

Advances and Trends in Automata and Formal Languages A Collection of Papers in Honour of the 60th Birthday of Helmut Jürgensen - J.UCS Special IssueCristian Calude, Kai Salomaa, Sheng Yu. jucs, 8(2):117-118, 2002. [doi]

Additive Distances and Quasi-Distances Between WordsCristian Calude, Kai Salomaa, Sheng Yu. jucs, 8(2):141-152, 2002. [doi]

2001

Recursively enumerable reals and Chaitin Omega numbersCristian Calude, Peter Hertling, Bakhadyr Khoussainov, Yongge Wang. TCS, 255(1-2):125-149, 2001. [doi]

Automata: From Uncertainty to QuantumCristian Calude, Elena Calude. dlt 2002: 1-14 [doi]

Coding with Minimal ProgramsCristian Calude, Hajime Ishihara, Takeshi Yamaguchi. ijfcs, 12(4):479-490, 2001.

2000

Automata, Logic, and Computability: J.UCS Special Issue Dedicated to Professor Sergiu Rudeanu FestschriftCristian Calude, Gheorghe Stefanescu. jucs, 6(1):1-2, 2000. [doi]

Finite nondeterministic automata: Simulation and minimalityCristian Calude, Elena Calude, Bakhadyr Khoussainov. TCS, 242(1-2):219-235, 2000. [doi]

1999

Program-Size Complexity of Initial Segments and Domination ReducibilityCristian Calude, Richard J. Coles. BIRTHDAY 1999: 225-237

Bisimulations and behaviour of nondeterministic automataCristian Calude, Elena Calude. dlt 2000: 60-70

Metric Lexical AnalysisCristian Calude, Kai Salomaa, Sheng Yu. wia 2001: 48-59 [doi]

1998

Recursively Enumerable Reals and Chaitin Omega NumbersCristian Calude, Peter Hertling, Bakhadyr Khoussainov, Yongge Wang. STACS 1998: 596-606

Computable Approximations of Reals: An Information-Theoretic AnalysisCristian Calude, Peter Hertling. FUIN, 33(2):105-120, 1998.

Computational Complementarity for Mealy AutomataCristian Calude, Elena Calude, Catalina Stefanescu. eatcs, 66:139-149, 1998.

1997

Effects of Kolmogorov Complexity Present in Inductive Inference as WellAndris Ambainis, Kalvis Apsitis, Cristian Calude, Rusins Freivalds, Marek Karpinski, Tomas Larfeldt, Iveta Sala, Juris Smotrovs. alt 1997: 244-259

Logic in Computer ScienceDouglas S. Bridges, Cristian Calude, Michael J. Dinneen, Bakhadyr Khoussainov. jucs, 3(11):1133, 1997. [doi]

Optimum Extendible Prefix CodesCristian Calude, Ioan Tomescu. jucs, 3(11):1167-1179, 1997. [doi]

Do the Zeros of Riemann s Zeta-Function Form a Random Sequence?Cristian Calude, Peter Hertling, Bakhadyr Khoussainov. eatcs, 62, 1997.

Chaitin Omega Numbers and Strong ReducibilitiesCristian Calude, André Nies. jucs, 3(11):1162-1166, 1997. [doi]

Deterministic Automata: Simulation, Universality and MinimalityCristian Calude, Elena Calude, Bakhadyr Khoussainov. APAL, 90(1-3):263-276, 1997.

Language-theoretic Complexity of Disjunctive SequencesCristian Calude, Sheng Yu. DAM, 80(2-3):203-209, 1997. [doi]

1996

Effective Category and Measure in Abstract Complexity TheoryCristian Calude, Marius Zimand. TCS, 154(2):307-327, 1996. [doi]

The Finite, The Unbounded and The InfiniteCristian Calude. jucs, 2(5):242-244, 1996.

Kraft-Chaitin Inequality RevisitedCristian Calude, Cristian Grozes. jucs, 2(5):306-310, 1996.

Algorithmic Information Theory: Open ProblemsCristian Calude. jucs, 2(5):439-441, 1996.

Are binary codings universal?Cristian Calude, Cezar Câmpeanu. complexity, 1(5):47-50, 1996. [doi]

1995

Effective Category and Measure in Abstract Complexity Theory (Extended Abstract)Cristian Calude, Marius Zimand. fct 1995: 156-170

What Is a Random String?Cristian Calude. jucs, 1(1):48-66, 1995. [doi]

Program-size Complexity Computes the Halting ProblemGregory J. Chaitin, Asat Arslanov, Cristian Calude. eatcs, 57, 1995.

1994

On Recursive Bounds for the Exceptional Values in Speed-UpDouglas S. Bridges, Cristian Calude. TCS, 132(2):387-394, 1994.

Randomness as an Invariant for Number RepresentationsCristian Calude, Helmut Jürgensen. BIRTHDAY 1994: 44-66

Three Theories of Computational Complexity Extended AbstractCristian Calude, Monica Tataram. cuza, 3:45-52, 1994.

Information and Randomness - An Algorithmic PerspectiveCristian Calude. EATCS Monographs on Theoretical Computer Science, Springer, 1994. [doi]

Pocket MathematicsCristian Calude, Hermann Maurer. In Gheorghe Paun, editor, Mathematical Aspects of Natural and Formal Languages. Volume 43 of World scientific series in computer science, pages 13-41, World Scientific, 1994. [doi]

Journal of Universal Computer ScienceCristian Calude, Hermann A. Maurer, Arto Salomaa. jucs, 0(0):109-115, 1994. [doi]

1993

Borel Normality and Algorithmic RandomnessCristian Calude. dlt 1993: 113-129

Note on the Topological Structure of Random StringsCristian Calude, Cezar Câmpeanu. TCS, 112(2):383-390, 1993.

Algorithmically Coding the UniverseCristian Calude, Arto Salomaa. dlt 1993: 472-492

1991

Determining and Stationary Sets for Some Classes of Partial Recursive FunctionsCristian Calude, Gabriel Istrate. TCS, 82(1):151-155, 1991.

Relativized Topological Size of Sets of Partial Recursive FunctionsCristian Calude. TCS, 87(2):347-352, 1991.

1990

On a theorem of Günter AsserCristian Calude, Lila Santean. mlq, 36(2):143-147, 1990. [doi]

1989

Ehrenfeucht Test Set Theorem and Hilbert Basis Theorem: A Constructive GlimpseCristian Calude, Dragos Vaida. mfcs 1989: 177-184

1987

Super-Exponentials Nonprimitive Recursive, but RudimentaryCristian Calude. ipl, 25(5):311-316, 1987.

1986

Note on Ehrenfeucht s conjecture and Hilbert s basis theoremCristian Calude. eatcs, 29:18-21, 1986.

1984

A class of nuniversal P Marti-Löf testsCristian Calude, Ion Chitescu. eatcs, 23:15-21, 1984.

1983

Independent Instances for Some Undecidable ProblemsCristian Calude, Gheorghe Paun. ita, 17(1):49-54, 1983.

Representability of recursive P. Martin-Löf testsCristian Calude, Ion Chitescu. kybernetika, 19(6):526-536, 1983. [doi]

On representability of P. Martin-Löf testsCristian Calude, Ion Chitescu. kybernetika, 19(1):42-47, 1983. [doi]

On a class of independent problems related to Rice theoremCristian Calude. sigact, 15(2):53-57, 1983. [doi]

1982

Topological Size of Sets of Partial Recursive FunctionsCristian Calude. mlq, 28(27-32):455-462, 1982. [doi]

1981

Global syntax and semantics for recursively enumerable languagesCristian Calude, Gheorghe Paun. FUIN, 4(2):245-254, 1981.

1979

On topologies generated by Moisil resemblance relationsCristian Calude, Virgil Emil Cazanescu. DM, 25(2):109-115, 1979. [doi]

1976

On metrizability of the free monoidsCristian Calude. DM, 15(4):307-310, 1976. [doi]

Sign in or sign up to see more results.

runs on WebDSL