default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDCristian S. Calude
Cristian Calude
Person information
- affiliation: University of Auckland, New Zealand
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2024
[b3]Cristian S. Calude:
To Halt or Not to Halt? That Is the Question. WorldScientific 2024, ISBN 9789811232275, pp. 1-332- [j140]José Manuel Agüero Trejo, Cristian S. Calude
, Michael J. Dinneen, Arkady Fedorov, Anatoly Kulikov, Rohit Navarathna, Karl Svozil:
How real is incomputability in physics? Theor. Comput. Sci. 1003: 114632 (2024) - 2023
- [j139]Cristian S. Calude, Shahrokh Heidari, Joseph Sifakis:
What perceptron neural networks are (not) good for? Inf. Sci. 621: 844-857 (2023) - [i12]José Manuel Agüero Trejo, Cristian S. Calude, Michael J. Dinneen, Arkady Fedorov, Anatoly Kulikov, Rohit Navarathna, Karl Svozil:
How Real is Incomputability in Physics? CoRR abs/2311.00908 (2023) - 2022
- [j138]Cristian S. Calude, Sanjay Jain, Bakhadyr Khoussainov, Wei Li, Frank Stephan:
Deciding Parity Games in Quasi-polynomial Time. SIAM J. Comput. 51(2): 17-152 (2022) - 2021
- [j137]Cristian S. Calude, Gheorghe Paun:
Solomon Marcus Contributions to Theoretical Computer Science and Applications. Axioms 10(2): 54 (2021) - [j136]Cristian S. Calude:
Incompleteness and the Halting Problem. Stud Logica 109(5): 1159-1169 (2021) - [j135]José Manuel Agüero Trejo, Cristian S. Calude:
A new quantum random number generator certified by value indefiniteness. Theor. Comput. Sci. 862: 3-13 (2021) - [j134]Cristian S. Calude, Karen Frilya Celine, Ziyuan Gao, Sanjay Jain, Ludwig Staiger, Frank Stephan:
Bi-immunity over different size alphabets. Theor. Comput. Sci. 894: 31-49 (2021) - [c37]Cristian S. Calude:
Gödel Incompleteness and Proof-Assistants Extended Abstract. SYNASC 2021: 1-3 - 2020
- [j133]Cristian S. Calude, Monica Dumitrescu:
A statistical anytime algorithm for the Halting Problem. Comput. 9(2): 155-166 (2020) - [j132]Cristian S. Calude, Michael J. Dinneen, Richard Hua:
Quantum solutions for densest k-subgraph problems. J. Membr. Comput. 2(1): 26-41 (2020) - [j131]Cristian S. Calude, Monica Dumitrescu:
Infinitesimal Probabilities Based on Grossone. SN Comput. Sci. 1(1): 36:1-36:8 (2020) - [j130]Cristian S. Calude, Sanjay Jain, Wolfgang Merkle, Frank Stephan:
Searching for shortest and least programs. Theor. Comput. Sci. 807: 114-127 (2020)
2010 – 2019
- 2018
- [j129]Cristian S. Calude, Monica Dumitrescu:
A probabilistic anytime algorithm for the halting problem. Comput. 7(2-3): 259-271 (2018) - [j128]Edward H., Cristian S. Calude:
Quassical Computing. Int. J. Unconv. Comput. 14(1): 43-57 (2018) - [j127]Cristian S. Calude, Ludwig Staiger:
A Simple Construction of Absolutely Disjunctive Liouville Numbers. J. Autom. Lang. Comb. 23(1-3): 103-109 (2018) - [j126]Cristian S. Calude, Ludwig Staiger:
Liouville, Computable, Borel Normal and Martin-Löf Random Numbers. Theory Comput. Syst. 62(7): 1573-1585 (2018) - [c36]Alastair A. Abbott, Cristian S. Calude, Michael J. Dinneen, Richard Hua:
A Hybrid Quantum-Classical Paradigm to Mitigate Embedding Costs in Quantum Annealing - Abridged Version. PC@UCNC 2018: 1-13 - [i11]Alastair A. Abbott, Cristian S. Calude, Michael J. Dinneen, Richard Hua:
A Hybrid Quantum-Classical Paradigm to Mitigate Embedding Costs in Quantum Annealing. CoRR abs/1803.04340 (2018) - 2017
- [j125]Cristian S. Calude, Michael J. Dinneen, Richard Hua:
QUBO formulations for the graph isomorphism problem and related problems. Theor. Comput. Sci. 701: 54-69 (2017) - [c35]Cristian S. Calude, Sanjay Jain, Bakhadyr Khoussainov, Wei Li, Frank Stephan:
Deciding parity games in quasipolynomial time. STOC 2017: 252-263 - [p4]Cristian S. Calude:
Quantum Randomness: From Practice to Theory and Back. The Incomputable 2017: 169-181 - 2016
- [j124]Cristian S. Calude:
Solomon Marcus, 1925-2016. Bull. EATCS 120 (2016) - [j123]Cristian S. Calude, Ludwig Staiger, Frank Stephan:
Finite state incompressible infinite sequences. Inf. Comput. 247: 23-36 (2016) - [j122]Cristian S. Calude, Michael J. Dinneen:
Editorial. Int. J. Unconv. Comput. 12(1): 1-2 (2016) - [j121]Cristian S. Calude, Giuseppe Longo:
Classical, quantum and biological randomness as relative unpredictability. Nat. Comput. 15(2): 263-278 (2016) - [c34]Cristian S. Calude, Declan Thompson:
Incompleteness, Undecidability and Automated Proofs - (Invited Talk). CASC 2016: 134-155 - 2015
- [j120]Cristian S. Calude:
News from New Zealand. Bull. EATCS 115 (2015) - [j119]Cristian S. Calude, Damien Desfontaines:
Universality and Almost Decidability. Fundam. Informaticae 138(1-2): 77-84 (2015) - [j118]Cristian S. Calude, Damien Desfontaines:
Anytime Algorithms for Non-Ending Computations. Int. J. Found. Comput. Sci. 26(4): 465-476 (2015) - [j117]Alastair A. Abbott, Cristian S. Calude, Karl Svozil:
A Non-Probabilistic Model of Relativised Predictability in Physics. Inf. 6(4): 773-789 (2015) - [j116]Cristian S. Calude, Rusins Freivalds, Sanjay Jain, Frank Stephan:
Deterministic Frequency Pushdown Automata. J. Univers. Comput. Sci. 21(12): 1563-1576 (2015) - [j115]Cristian S. Calude, Elena Calude, Michael J. Dinneen:
Guest Column: Adiabatic Quantum Computing Challenges. SIGACT News 46(1): 40-61 (2015) - [c33]Alastair A. Abbott, Cristian S. Calude, Karl Svozil:
On the Unpredictability of Individual Quantum Measurement Outcomes. Fields of Logic and Computation II 2015: 69-86 - [e19]Cristian S. Calude, Michael J. Dinneen:
Unconventional Computation and Natural Computation - 14th International Conference, UCNC 2015, Auckland, New Zealand, August 30 - September 3, 2015, Proceedings. Lecture Notes in Computer Science 9252, Springer 2015, ISBN 978-3-319-21818-2 [contents] - [i10]Cristian S. Calude, Damien Desfontaines:
Universality and Almost Decidability. CoRR abs/1505.01340 (2015) - 2014
- [j114]Cristian S. Calude:
News from New Zealand. Bull. EATCS 112 (2014) - [j113]Cristian S. Calude:
News from New Zealand. Bull. EATCS 113 (2014) - [j112]Cristian S. Calude:
News from New Zealand. Bull. EATCS 114 (2014) - [j111]Cristian S. Calude, Marian Gheorghe:
Preface. Fundam. Informaticae 131(3-4) (2014) - [j110]Alastair A. Abbott, Cristian S. Calude, Karl Svozil:
A quantum random number generator certified by value indefiniteness. Math. Struct. Comput. Sci. 24(3) (2014) - [c32]Cristian S. Calude, Alasdair Coull, John P. Lewis:
Can we solve the pipeline problem? DigiPro 2014: 25-27 - [c31]Cristian S. Calude, Ludwig Staiger, Frank Stephan:
Finite State Incompressible Infinite Sequences. TAMC 2014: 50-66 - [e18]Cristian S. Calude, Rusins Freivalds, Kazuo Iwama:
Computing with New Resources - Essays Dedicated to Jozef Gruska on the Occasion of His 80th Birthday. Lecture Notes in Computer Science 8808, Springer 2014, ISBN 978-3-319-13349-2 [contents] - 2013
- [j109]Cristian S. Calude:
News from New Zealand. Bull. EATCS 109: 25-34 (2013) - [j108]Cristian S. Calude:
News from New Zealand. Bull. EATCS 110: 25-32 (2013) - [j107]Mark Burgin, Cristian S. Calude, Elena Calude:
Inductive Complexity Measures for Mathematical Problems. Int. J. Found. Comput. Sci. 24(4): 487-500 (2013) - [j106]Cristian S. Calude, Elena Calude:
Algorithmic Complexity of Mathematical Problems: An Overview of Results and Open Problems. Int. J. Unconv. Comput. 9(3-4): 327-343 (2013) - [j105]Cristian S. Calude, Elena Calude, Melissa S. Queen:
Inductive Complexity of the P versus NP Problem. Parallel Process. Lett. 23(1) (2013) - [j104]Cristian Calude, Bruno Durand, Anahí Gajardo, Dominique Perrin, Ivan Rapaport, Sergio Rica:
Discrete mathematical structures: From dynamics to complexity. Theor. Comput. Sci. 504: 3-4 (2013) - [c30]Cristian S. Calude, Kohtaro Tadaki:
Spectral Representation of Some Computably Enumerable Sets with an Application to Quantum Provability. UCNC 2013: 43-54 - 2012
- [j103]Cristian S. Calude, J. P. Lewis:
Is there a universal image generator? Appl. Math. Comput. 218(16): 8151-8159 (2012) - [j102]Cristian S. Calude, José Félix Costa, Hélia Guerra:
Preface to the Special Issue on Physics and Computation "Towards a Computational Interpretation of Physical Theories". Appl. Math. Comput. 219(1): 1-2 (2012) - [j101]Alastair A. Abbott, Cristian S. Calude:
Von Neumann Normalisation of a Quantum Random Number Generator. Comput. 1(1): 59-83 (2012) - [j100]Cristian S. Calude:
News from New Zealand. Bull. EATCS 106: 19-27 (2012) - [j99]Cristian Calude:
News from New Zealand. Bull. EATCS 107: 29-40 (2012) - [j98]Cristian S. Calude:
News from New Zealand. Bull. EATCS 108: 37-45 (2012) - [j97]David H. Bailey, Jonathan M. Borwein, Cristian S. Calude, Michael J. Dinneen, Monica Dumitrescu, Alex Yee:
An Empirical Approach to the Normality of π. Exp. Math. 21(4): 375-384 (2012) - [j96]Cristian S. Calude, Kai Salomaa, Tania Roblot:
State-Size Hierarchy for Finite-State Complexity. Int. J. Found. Comput. Sci. 23(1): 37-50 (2012) - [j95]Alastair A. Abbott, Matthias Bechmann, Cristian S. Calude, Angelika Sebald:
A Nuclear Magnetic Resonance Implementation of a Classical Deutsch-Jozsa Algorithm. Int. J. Unconv. Comput. 8(2): 161-175 (2012) - [j94]Cristian S. Calude, S. Barry Cooper:
Introduction: computability of the physical. Math. Struct. Comput. Sci. 22(5): 723-728 (2012) - [j93]Cristian S. Calude, Elena Calude, Melissa S. Queen:
The complexity of Euler's integer partition theorem. Theor. Comput. Sci. 454: 72-80 (2012) - [c29]Cristian S. Calude, Elena Calude, Melissa S. Queen:
Inductive Complexity of P versus NP Problem - Extended Abstract. UCNC 2012: 2-9 - 2011
- [j92]Ali Akhtarzada, Cristian S. Calude, John G. Hosking:
A Multi-Criteria Metric Algorithm for Recommender Systems. Fundam. Informaticae 110(1-4): 1-11 (2011) - [j91]Cristian S. Calude, Matteo Cavaliere, Radu Mardare:
An Observer-Based de-Quantisation of Deutsch's Algorithm. Int. J. Found. Comput. Sci. 22(1): 191-201 (2011) - [j90]Cristian S. Calude, José Félix Costa:
Editorial. Int. J. Unconv. Comput. 7(5): 313 (2011) - [j89]Cristian S. Calude, Nicholas J. Hay, Frank Stephan:
Representation of left-computable ε-random reals. J. Comput. Syst. Sci. 77(4): 812-819 (2011) - [j88]Cristian S. Calude:
Simplicity via provability for universal prefix-free Turing machines. Theor. Comput. Sci. 412(1-2): 178-182 (2011) - [j87]Cristian S. Calude, André Nies, Ludwig Staiger, Frank Stephan:
Universal recursively enumerable sets of strings. Theor. Comput. Sci. 412(22): 2253-2261 (2011) - [j86]Cristian S. Calude, Kai Salomaa, Tania Roblot:
Finite state complexity. Theor. Comput. Sci. 412(41): 5668-5677 (2011) - [j85]Cristian Calude:
An Interview with Erol Gelenbe: Practical Theories Make the World Go (Part II). Ubiquity 2011(January): 4 (2011) - [c28]Alastair A. Abbott, Cristian S. Calude:
Von Neumann Normalisation and Symptoms of Randomness: An Application to Sequences of Quantum Random Bits. UC 2011: 40-51 - [e17]Cristian S. Calude, Grzegorz Rozenberg, Arto Salomaa:
Rainbow of Computer Science - Dedicated to Hermann Maurer on the Occasion of His 70th Birthday. Lecture Notes in Computer Science 6570, Springer 2011, ISBN 978-3-642-19390-3 [contents] - [e16]Cristian S. Calude, Jarkko Kari, Ion Petre, Grzegorz Rozenberg:
Unconventional Computation - 10th International Conference, UC 2011, Turku, Finland, June 6-10, 2011. Proceedings. Lecture Notes in Computer Science 6714, Springer 2011, ISBN 978-3-642-21340-3 [contents] - [i9]Alastair A. Abbott, Cristian S. Calude:
Von Neumann Normalisation of a Quantum Random Number Generator. CoRR abs/1101.4711 (2011) - [i8]Alastair A. Abbott, Matthias Bechmann, Cristian S. Calude, Angelika Sebald:
A Nuclear Magnetic Resonance Implementation of a Classical Deutsch-Jozsa Algorithm. CoRR abs/1110.0177 (2011) - 2010
- [j84]Cristian S. Calude, Elena Calude:
Evaluating the Complexity of Mathematical Problems: Part 2. Complex Syst. 18(4) (2010) - [j83]Cristian S. Calude, Marius Zimand:
Algorithmically independent sequences. Inf. Comput. 208(3): 292-308 (2010) - [j82]Cristian S. Calude, Elena Calude:
The complexity of the four colour theorem. LMS J. Comput. Math. 13: 414-425 (2010) - [j81]Cristian S. Calude, Ludwig Staiger:
A note on accelerated Turing machines. Math. Struct. Comput. Sci. 20(6): 1011-1017 (2010) - [j80]Cristian S. Calude, José Félix Costa:
Preface to the Special Issue Unconventional Computing 2008. Nat. Comput. 9(4): 793-794 (2010) - [j79]Cristian Calude:
An Interview with Erol Gelenbe. Ubiquity 2010(December): 3 (2010) - [c27]Alastair A. Abbott, Cristian S. Calude:
Understanding the Quantum Computational Speed-up via De-quantisation. DCM 2010: 1-12 - [c26]Cristian Calude, Kai Salomaa, Tania Roblot:
Finite-State Complexity and the Size of Transducers. DCFS 2010: 38-47 - [e15]Cristian S. Calude, Vladimiro Sassone:
Theoretical Computer Science - 6th IFIP TC 1/WG 2.2 International Conference, TCS 2010, Held as Part of WCC 2010, Brisbane, Australia, September 20-23, 2010. Proceedings. IFIP Advances in Information and Communication Technology 323, Springer 2010, ISBN 978-3-642-15239-9 [contents] - [e14]Cristian S. Calude, Masami Hagiya, Kenichi Morita, Grzegorz Rozenberg, Jon Timmis:
Unconventional Computation - 9th International Conference, UC 2010, Tokyo, Japan, June 21-25, 2010. Proceedings. Lecture Notes in Computer Science 6079, Springer 2010, ISBN 978-3-642-13522-4 [contents] - [i7]Cristian S. Calude, Michael J. Dinneen, Monica Dumitrescu, Karl Svozil:
Experimental Evidence of Quantum Randomness Incomputability. CoRR abs/1004.1521 (2010) - [i6]Cristian S. Calude, Elena Calude, Karl Svozil:
Pi_1-Statements, Chaotic Systems and the Church-Turing Thesis. CoRR abs/1006.2951 (2010)
2000 – 2009
- 2009
- [j78]Cristian S. Calude, José Félix Costa:
Introduction. Appl. Math. Comput. 215(4): 1309-1310 (2009) - [j77]Cristian S. Calude, Elena Calude:
Evaluating the Complexity of Mathematical Problems: Part 1. Complex Syst. 18(3) (2009) - [j76]Cristian S. Calude, Nicholas J. Hay:
Every computably enumerable random real is provably computably enumerable random. Log. J. IGPL 17(4): 351-374 (2009) - [j75]Cristian S. Calude, Ludwig Staiger:
On universal computably enumerable prefix codes. Math. Struct. Comput. Sci. 19(1): 45-57 (2009) - [j74]Cristian S. Calude, José Félix Costa:
Introduction. Nat. Comput. 8(3): 429-430 (2009) - [j73]Cristian S. Calude, Helmut Jürgensen, Ludwig Staiger:
Topology on words. Theor. Comput. Sci. 410(24-25): 2323-2335 (2009) - [c25]Cristian S. Calude, Christine Müller:
Formal Proof: Reconciling Correctness and Understanding. Calculemus/MKM 2009: 217-232 - [c24]Cristian S. Calude:
Information: The Algorithmic Paradigm. Formal Theories of Information 2009: 79-94 - [e13]Cristian S. Calude, José Félix Costa, Nachum Dershowitz, Elisabete Freire, Grzegorz Rozenberg:
Unconventional Computation, 8th International Conference, UC 2009, Ponta Delgada, Azores, Portugal, September 7-11, 2009. Proceedings. Lecture Notes in Computer Science 5715, Springer 2009, ISBN 978-3-642-03744-3 [contents] - 2008
- [j72]Cristian S. Calude, Michael A. Stay:
Most programs stop quickly or never halt. Adv. Appl. Math. 40(3): 295-308 (2008) - [j71]Cristian S. Calude, Gheorghe Paun:
Foreword. Nat. Comput. 7(1): 1 (2008) - [c23]Cristian Calude:
Incompleteness: A Personal Perspective. DCFS 2008: 14-24 - [c22]Cristian S. Calude, André Nies, Ludwig Staiger, Frank Stephan:
Universal Recursively Enumerable Sets of Strings. Developments in Language Theory 2008: 170-182 - [c21]Cristian S. Calude, Marius Zimand:
Algorithmically Independent Sequences. Developments in Language Theory 2008: 183-195 - [c20]Cristian S. Calude:
Simplicity via Provability for Universal Prefix-free Turing Machines. CSP 2008: 16-21 - [e12]Cristian S. Calude, José Félix Costa, Rudolf Freund, Marion Oswald, Grzegorz Rozenberg:
Unconventional Computing, 7th International Conference, UC 2008, Vienna, Austria, August 25-28, 2008. Proceedings. Lecture Notes in Computer Science 5204, Springer 2008, ISBN 978-3-540-85193-6 [contents] - [i5]Cristian S. Calude, Marius Zimand:
Algorithmically independent sequences. CoRR abs/0802.0487 (2008) - [i4]Cristian S. Calude, Nicholas J. Hay:
Every Computably Enumerable Random Real Is Provably Computably Enumerable Random. CoRR abs/0808.2220 (2008) - 2007
- [j70]Cristian S. Calude, Michael J. Dinneen:
Exact Approximations of omega Numbers. Int. J. Bifurc. Chaos 17(6): 1937-1954 (2007) - [j69]Cristian S. Calude, Gheorghe Stefanescu, Marius Zimand:
Combinatorics and Related Areas A Collection of Papers in Honour of the 65th Birthday of Ioan Tomescu. J. Univers. Comput. Sci. 13(11): 1498-1500 (2007) - [j68]Cristian S. Calude, Rossella Lupacchini, Giorgio Sandri:
Preface. Nat. Comput. 6(2): 73-74 (2007) - [j67]Mark Burgin, Cristian S. Calude:
Preface. Theor. Comput. Sci. 383(2-3): 111-114 (2007) - [e11]Selim G. Akl, Cristian S. Calude, Michael J. Dinneen, Grzegorz Rozenberg, Todd Wareham:
Unconventional Computation, 6th International Conference, UC 2007, Kingston, Canada, August 13-17, 2007, Proceedings. Lecture Notes in Computer Science 4618, Springer 2007, ISBN 978-3-540-73553-3 [contents] - 2006
- [j66]Cristian S. Calude, Ludwig Staiger, Sebastiaan Terwijn:
On partial randomness. Ann. Pure Appl. Log. 138(1-3): 20-30 (2006) - [j65]Cristian S. Calude, Cezar Câmpeanu, Monica Dumitrescu:
Automata Recognizing No Words: A Statistical Approach. Fundam. Informaticae 73(1-2): 1-18 (2006) - [j64]Cristian S. Calude, Michael Stay:
Natural halting probabilities, partial randomness, and zeta functions. Inf. Comput. 204(11): 1718-1739 (2006) - [j63]Cristian S. Calude, Elena Calude, Michael J. Dinneen:
A New Measure of the Difficulty of Problems. J. Multiple Valued Log. Soft Comput. 12(3-4): 285-307 (2006) - [e10]Cristian S. Calude, Michael J. Dinneen, Gheorghe Paun, Grzegorz Rozenberg, Susan Stepney:
Unconventional Computation, 5th International Conference, UC 2006, York, UK, September 4-8, 2006, Proceedings. Lecture Notes in Computer Science 4135, Springer 2006, ISBN 3-540-38593-2 [contents] - [i3]Cristian S. Calude, Michael A. Stay:
Natural Halting Probabilities, Partial Randomness, and Zeta Functions. Kolmogorov Complexity and Applications 2006 - [i2]Cristian S. Calude, Michael Stay:
Natural Halting Probabilities, Partial Randomness, and Zeta Functions. CoRR abs/cs/0606033 (2006) - [i1]Cristian S. Calude, Michael Stay:
Most Programs Stop Quickly or Never Halt. CoRR abs/cs/0610153 (2006) - 2005
- [j62]Cristian S. Calude, Helmut Jürgensen:
Is complexity a source of incompleteness? Adv. Appl. Math. 35(1): 1-15 (2005) - [j61]Cristian S. Calude, Gheorghe Paun, Grzegorz Rozenberg:
Contagious Creativity. Fundam. Informaticae 64(1-4) (2005) - [j60]Cristian Calude, Sergiu Rudeanu:
Proving as a Computable Procedure. Fundam. Informaticae 64(1-4): 43-52 (2005) - [j59]Cristian Calude:
Preface. Int. J. Found. Comput. Sci. 16(4): 623-624 (2005) - [j58]Cristian S. Calude, Hajime Ishihara:
Constructivity, Computability, and Logic A Collection of Papers in Honour of the 60th Birthday of Douglas Bridges. J. Univers. Comput. Sci. 11(12): 1863-1865 (2005) - [j57]Cristian S. Calude, Ludwig Staiger:
Generalisations of disjunctive sequences. Math. Log. Q. 51(2): 120-128 (2005) - [e9]Cristian Calude, Michael J. Dinneen, Gheorghe Paun, Mario J. Pérez-Jiménez, Grzegorz Rozenberg:
Unconventional Computation, 4th International Conference, UC 2005, Sevilla, Spain, October 3-7, 2005, Proceedings. Lecture Notes in Computer Science 3699, Springer 2005, ISBN 3-540-29100-8 [contents] - 2004
- [j56]Cristian Calude, Elena Calude, Solomon Marcus:
Passages of Proof. Bull. EATCS 84: 167-188 (2004) - [j55]Joshua J. Arulanandham, Cristian Calude, Michael J. Dinneen:
A fast natural algorithm for searching. Theor. Comput. Sci. 320(1): 3-13 (2004) - [c19]Cristian Calude, Solomon Marcus:
Mathematical Proofs at a Crossroad? Theory Is Forever 2004: 15-28 - [c18]Joshua J. Arulanandham, Cristian Calude, Michael J. Dinneen:
Balance Machines: Computing = Balancing. Aspects of Molecular Computing 2004: 36-48 - [c17]Cristian Calude:
Algorithmic Randomness, Quantum Physics, and Incompleteness. MCU 2004: 1-17 - [e8]Cristian Calude, Elena Calude, Michael J. Dinneen:
Developments in Language Theory, 8th International Conference, DLT 2004, Auckland, New Zealand, December 13-17, 2004, Proceedings. Lecture Notes in Computer Science 3340, Springer 2004, ISBN 3-540-24014-4 [contents] - 2003
- [j54]Cristian Calude, Solomon Marcus, Ludwig Staiger:
A topological characterization of random sequences. Inf. Process. Lett. 88(5): 245-250 (2003) - [j53]Cristian Calude, Elena Calude, Michael J. Dinneen:
What is the Value of Taxicab(6)? J. Univers. Comput. Sci. 9(10): 1196-1203 (2003) - [e7]Cristian Calude, Michael J. Dinneen, Vincent Vajnovszki:
Discrete Mathematics and Theoretical Computer Science, 4th International Conference, DMTCS 2003, Dijon, France, July 7-12, 2003. Proceedings. Lecture Notes in Computer Science 2731, Springer 2003, ISBN 3-540-40505-4 [contents] - 2002
- [b2]Cristian S. Calude:
Information and Randomness - An Algorithmic Perspective. Texts in Theoretical Computer Science. An EATCS Series, Springer 2002, ISBN 978-3-642-07793-7, pp. 1-468 - [j52]Cristian S. Calude, Monica Dumitrescu:
Entropic measures, Markov information sources and complexity. Appl. Math. Comput. 132(2-3): 369-384 (2002) - [j51]Joshua J. Arulanandham, Cristian Calude, Michael J. Dinneen:
Bead-Sort: A Natural Sorting Algorithm. Bull. EATCS 76: 153-161 (2002) - [j50]Cristian Calude, Elena Calude:
The Bridge Crossing Problem. Bull. EATCS 77: 180-190 (2002) - [j49]Cristian S. Calude, Michael J. Dinneen, Chi-Kou Shu:
Computing a Glimpse of Randomness. Exp. Math. 11(3): 361-370 (2002) - [j48]Cristian Calude, Kai Salomaa, Sheng Yu:
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 Issue. J. Univers. Comput. Sci. 8(2): 117-118 (2002) - [j47]Cristian Calude, Kai Salomaa, Sheng Yu:
Additive Distances and Quasi-Distances Between Words. J. Univers. Comput. Sci. 8(2): 141-152 (2002) - [j46]Cristian S. Calude:
Incompleteness, Complexity, Randomness and Beyond. Minds Mach. 12(4): 503-517 (2002) - [j45]Cristian S. Calude, Boris S. Pavlov:
Coins, Quantum Measurements, and Turing's Barrier. Quantum Inf. Process. 1(1-2): 107-127 (2002) - [j44]Cristian Calude:
A characterization of c.e. random reals. Theor. Comput. Sci. 271(1-2): 3-14 (2002) - [j43]Cristian Calude:
Chaitin Omega numbers, Solovay machines, and Gödel incompleteness. Theor. Comput. Sci. 284(2): 269-277 (2002) - [e6]Cristian Calude, Michael J. Dinneen, Ferdinand Peper:
Unconventional Models of Computation, Third International Conference, UMC 2002, Kobe, Japan, October 15-19, 2002, Proceedings. Lecture Notes in Computer Science 2509, Springer 2002, ISBN 3-540-44311-8 [contents] - 2001
- [j42]Cristian Calude, Hajime Ishihara, Takeshi Yamaguchi:
Coding with Minimal Programs. Int. J. Found. Comput. Sci. 12(4): 479-490 (2001) - [j41]Cristian Calude, Peter Hertling, Bakhadyr Khoussainov, Yongge Wang:
Recursively enumerable reals and Chaitin Omega numbers. Theor. Comput. Sci. 255(1-2): 125-149 (2001) - [c16]Cristian S. Calude, Elena Calude, Peter Kay:
Liars, Demons, and Chaos. Words, Semigroups, and Transductions 2001: 33-46 - [c15]Cristian S. Calude, Elena Calude, Karl Svozil:
Computational complementarity for probabilistic automata. Where Mathematics, Computer Science, Linguistics and Biology Meet 2001: 99-113 - [c14]Cristian Calude, Elena Calude:
Automata: From Uncertainty to Quantum. Developments in Language Theory 2001: 1-14 - [e5]Cristian S. Calude, Michael J. Dinneen, Silviu Sburlan:
Combinatorics, Computability and Logic, Proceedings of the Third International Conference on Combinatorics, Computability and Logic, DMTCS 20Ol, Constanta, Romania. Discrete mathematics and theoretical computer science, Springer 2001, ISBN 978-1-85233-526-7 [contents] - [e4]Ioannis Antoniou, Cristian Calude, Michael J. Dinneen:
Unconventional Models of Computation, UMC'2K, Proceedings of the Second International Conference, Brussel, Belgium, 13-16 December 2000. Springer 2001, ISBN 1-85233-415-0 [contents] - [e3]Cristian Calude, Gheorghe Paun, Grzegorz Rozenberg, Arto Salomaa:
Multiset Processing, Mathematical, Computer Science, and Molecular Computing Points of View [Workshop on Multiset Processing, WMP 2000, Curtea de Arges, Romania, August 21-25, 2000]. Lecture Notes in Computer Science 2235, Springer 2001, ISBN 3-540-43063-6 [contents] - 2000
- [j40]Cristian S. Calude, Michael J. Dinneen, Karl Svozil:
Reflections on quantum computing. Complex. 6(1): 35-37 (2000) - [j39]Cristian S. Calude, Gheorghe Paun:
Computing with cells and atoms in a nutshell. Complex. 6(1): 38-48 (2000) - [j38]Cristian Calude, Gheorghe Stefanescu:
Automata, Logic, and Computability: J.UCS Special Issue Dedicated to Professor Sergiu Rudeanu Festschrift. J. Univers. Comput. Sci. 6(1): 1-2 (2000) - [j37]Cristian Calude, Elena Calude, Bakhadyr Khoussainov:
Finite nondeterministic automata: Simulation and minimality. Theor. Comput. Sci. 242(1-2): 219-235 (2000) - [c13]Cristian S. Calude, Elena Calude, Karl Svozil:
Quantum Correlations Conundrum: An Automata-Theoretic Approach. Recent Topics in Mathematical and Computational Linguistics 2000: 55-67 - [p3]Cristian S. Calude, Helmut Jürgensen, Shane Legg:
Solving Problems with Finite Test Sets. Finite Versus Infinite 2000: 39-52 - [e2]Cristian Calude, Gheorghe Paun:
Finite Versus Infinite. Discrete mathematics and theoretical computer science, Springer 2000, ISBN 978-1-85233-251-8 [contents]
1990 – 1999
- 1999
- [c12]Cristian Calude, Richard J. Coles:
Program-Size Complexity of Initial Segments and Domination Reducibility. Jewels are Forever 1999: 225-237 - [c11]Cristian Calude, Elena Calude:
Bisimulations and behaviour of nondeterministic automata. Developments in Language Theory 1999: 60-70 - [c10]Cristian Calude, Kai Salomaa, Sheng Yu:
Metric Lexical Analysis. WIA 1999: 48-59 - 1998
- [j36]Cristian S. Calude, John L. Casti:
Introduction to unconventional models of computation. Complex. 4(1): 13 (1998) - [j35]Cristian Calude, Elena Calude, Catalina Stefanescu:
Computational Complementarity for Mealy Automata. Bull. EATCS 66: 139-149 (1998) - [j34]Cristian Calude, Peter Hertling:
Computable Approximations of Reals: An Information-Theoretic Analysis. Fundam. Informaticae 33(2): 105-120 (1998) - [c9]Cristian S. Calude, Marjo Lipponen:
Computational Complementarity and Sofic Shifts. CATS 1998: 277-290 - [c8]Cristian Calude, Peter Hertling, Bakhadyr Khoussainov, Yongge Wang:
Recursively Enumerable Reals and Chaitin Omega Numbers. STACS 1998: 596-606 - 1997
- [j33]Cristian Calude, Elena Calude, Bakhadyr Khoussainov:
Deterministic Automata: Simulation, Universality and Minimality. Ann. Pure Appl. Log. 90(1-3): 263-276 (1997) - [j32]Cristian S. Calude:
A genius's story: Two books on Gödel. Complex. 3(2): 11-15 (1997) - [j31]Cristian Calude, Sheng Yu:
Language-theoretic Complexity of Disjunctive Sequences. Discret. Appl. Math. 80(2-3): 203-209 (1997) - [j30]Cristian Calude, Peter Hertling, Bakhadyr Khoussainov:
Do the Zeros of Riemann's Zeta-Function Form a Random Sequence? Bull. EATCS 62 (1997) - [j29]Douglas S. Bridges, Cristian Calude, Michael J. Dinneen, Bakhadyr Khoussainov:
Logic in Computer Science. J. Univers. Comput. Sci. 3(11): 1133 (1997) - [j28]Cristian Calude, André Nies:
Chaitin Omega Numbers and Strong Reducibilities. J. Univers. Comput. Sci. 3(11): 1162-1166 (1997) - [j27]Cristian Calude, Ioan Tomescu:
Optimum Extendible Prefix Codes. J. Univers. Comput. Sci. 3(11): 1167-1179 (1997) - [c7]Andris Ambainis, Kalvis Apsitis, Cristian Calude, Rusins Freivalds, Marek Karpinski, Tomas Larfeldt, Iveta Sala, Juris Smotrovs:
Effects of Kolmogorov Complexity Present in Inductive Inference as Well. ALT 1997: 244-259 - [c6]Cristian S. Calude, Elena Calude, Bakhadyr Khoussainov:
Deterministic Automata: Simulation, Universality and Minimality. Extended Abstract. Developments in Language Theory 1997: 519-537 - [p2]Cristian Calude, Juraj Hromkovic:
Complexity: A Language-Theoretic Point of View. Handbook of Formal Languages (2) 1997: 1-60 - 1996
- [j26]Cristian Calude, Cezar Câmpeanu:
Are binary codings universal? Complex. 1(5): 47-50 (1996) - [j25]Cristian Calude:
The Finite, The Unbounded and The Infinite. J. Univers. Comput. Sci. 2(5): 242-244 (1996) - [j24]Cristian Calude, Cristian Grozes:
Kraft-Chaitin Inequality Revisited. J. Univers. Comput. Sci. 2(5): 306-310 (1996) - [j23]Cristian Calude:
Algorithmic Information Theory: Open Problems. J. Univers. Comput. Sci. 2(5): 439-441 (1996) - [j22]Cristian Calude, Marius Zimand:
Effective Category and Measure in Abstract Complexity Theory. Theor. Comput. Sci. 154(2): 307-327 (1996) - [e1]Douglas S. Bridges, Cristian S. Calude, Jeremy Gibbons, Steve Reeves, Ian H. Witten:
First Conference of the Centre for Discrete Mathematics and Theoretical Computer Science, DMTCS 1996, Auckland, New Zealand, December, 9-13, 1996. Springer-Verlag, Singapore 1996, ISBN 981-3083-14-X [contents] - 1995
- [j21]Gregory J. Chaitin, Asat Arslanov, Cristian Calude:
Program-size Complexity Computes the Halting Problem. Bull. EATCS 57 (1995) - [j20]Cristian Calude:
What Is a Random String? J. Univers. Comput. Sci. 1(1): 48-66 (1995) - [c5]Cristian Calude, Marius Zimand:
Effective Category and Measure in Abstract Complexity Theory (Extended Abstract). FCT 1995: 156-170 - 1994
- [b1]Cristian Calude:
Information and Randomness - An Algorithmic Perspective. EATCS Monographs on Theoretical Computer Science, Springer 1994, ISBN 978-3-662-03051-6, pp. I-XVI, 1-243 - [j19]Cristian Calude, Monica Tataram:
Three Theories of Computational Complexity Extended Abstract. Sci. Ann. Cuza Univ. 3: 45-52 (1994) - [j18]Cristian Calude, Hermann A. Maurer, Arto Salomaa:
Journal of Universal Computer Science. J. Univers. Comput. Sci. 0(0): 109-115 (1994) - [j17]Douglas S. Bridges, Cristian Calude:
On Recursive Bounds for the Exceptional Values in Speed-Up. Theor. Comput. Sci. 132(2): 387-394 (1994) - [c4]Cristian Calude, Helmut Jürgensen:
Randomness as an Invariant for Number Representations. Results and Trends in Theoretical Computer Science 1994: 44-66 - [p1]Cristian Calude, Hermann Maurer:
Pocket Mathematics. Mathematical Aspects of Natural and Formal Languages 1994: 13-41 - 1993
- [j16]Cristian Calude, Cezar Câmpeanu:
Note on the Topological Structure of Random Strings. Theor. Comput. Sci. 112(2): 383-390 (1993) - [c3]Cristian Calude:
Borel Normality and Algorithmic Randomness. Developments in Language Theory 1993: 113-129 - [c2]Cristian Calude, Arto Salomaa:
Algorithmically Coding the Universe. Developments in Language Theory 1993: 472-492 - 1992
- [j15]Cristian S. Calude, Gabriel Istrate, Marius Zimand:
Recursive Baire Classification and Speedable Functions. Math. Log. Q. 38(1): 169-178 (1992) - 1991
- [j14]Cristian Calude, Gabriel Istrate:
Determining and Stationary Sets for Some Classes of Partial Recursive Functions. Theor. Comput. Sci. 82(1): 151-155 (1991) - [j13]Cristian Calude:
Relativized Topological Size of Sets of Partial Recursive Functions. Theor. Comput. Sci. 87(2): 347-352 (1991) - 1990
- [j12]Cristian Calude, Lila Santean:
On a theorem of Günter Asser. Math. Log. Q. 36(2): 143-147 (1990)
1980 – 1989
- 1989
- [c1]Cristian Calude, Dragos Vaida:
Ehrenfeucht Test Set Theorem and Hilbert Basis Theorem: A Constructive Glimpse. MFCS 1989: 177-184 - 1987
- [j11]Cristian Calude:
Super-Exponentials Nonprimitive Recursive, but Rudimentary. Inf. Process. Lett. 25(5): 311-316 (1987) - 1986
- [j10]Cristian Calude:
Note on Ehrenfeucht's conjecture and Hilbert's basis theorem. Bull. EATCS 29: 18-21 (1986) - 1984
- [j9]Cristian Calude, Ion Chitescu:
A class of nuniversal P Marti-Löf tests. Bull. EATCS 23: 15-21 (1984) - 1983
- [j8]Cristian Calude, Gheorghe Paun:
Independent Instances for Some Undecidable Problems. RAIRO Theor. Informatics Appl. 17(1): 49-54 (1983) - [j7]Cristian Calude, Ion Chitescu:
On representability of P. Martin-Löf tests. Kybernetika 19(1): 42-47 (1983) - [j6]Cristian Calude, Ion Chitescu:
Representability of recursive P. Martin-Löf tests. Kybernetika 19(6): 526-536 (1983) - [j5]Cristian Calude:
On a class of independent problems related to Rice theorem. SIGACT News 15(2): 53-57 (1983) - 1982
- [j4]Cristian Calude:
Topological Size of Sets of Partial Recursive Functions. Math. Log. Q. 28(27-32): 455-462 (1982) - 1981
- [j3]Cristian Calude, Gheorghe Paun:
Global syntax and semantics for recursively enumerable languages. Fundam. Informaticae 4(2): 245-254 (1981)
1970 – 1979
- 1979
- [j2]Cristian Calude, Virgil Emil Cazanescu:
On topologies generated by Moisil resemblance relations. Discret. Math. 25(2): 109-115 (1979) - 1976
- [j1]Cristian Calude:
On metrizability of the free monoids. Discret. Math. 15(4): 307-310 (1976)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-10-07 21:12 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
