Cristian S. Calude
#17,726
Most Influential Person Now
Romanian-New Zealand mathematician and computer scientist
Cristian S. Calude's AcademicInfluence.com Rankings
Cristian S. Caludecomputer-science Degrees
Computer Science
#1095
World Rank
#1135
Historical Rank
Recursion Theory
#2
World Rank
#2
Historical Rank
Theoretical Computer Science
#33
World Rank
#33
Historical Rank
Database
#3982
World Rank
#4141
Historical Rank
Cristian S. Caludemathematics Degrees
Mathematics
#2605
World Rank
#3993
Historical Rank
Measure Theory
#1579
World Rank
#1957
Historical Rank
Download Badge
Computer Science Mathematics
Cristian S. Calude's Degrees
- PhD Mathematics University of Bucharest
- PhD Computer Science University of Auckland
Similar Degrees You Can Earn
Why Is Cristian S. Calude Influential?
(Suggest an Edit or Addition)According to Wikipedia, Cristian Sorin Calude is a Romanian-New Zealander mathematician and computer scientist. Biography After graduating from the Vasile Alecsandri National College in Galați, he studied at the University of Bucharest, where he was student of Grigore C. Moisil and Solomon Marcus. Calude received his Ph.D. in Mathematics from the University of Bucharest under the direction of Solomon Marcus in 1977.
Cristian S. Calude's Published Works
Number of citations in a given year to any of this author's works
Total number of citations to an author for the works they published in a given year. This highlights publication of the most important work(s) by the author
Published Works
- The mathematical theory of information (2007) (598)
- Information and Randomness: An Algorithmic Perspective (1994) (461)
- The Deluge of Spurious Correlations in Big Data (2017) (268)
- Information and Randomness (1994) (247)
- Unconventional Models of Computation (2002) (206)
- Deciding parity games in quasipolynomial time (2017) (198)
- Discrete Mathematics and Theoretical Computer Science (2003) (180)
- Computing with Cells and Atoms: An Introduction to Quantum, DNA and Membrane Computing (2000) (124)
- Theories of computational complexity (1988) (93)
- Quantum randomness and value indefiniteness (2006) (92)
- Strong Kochen-Specker theorem and incomputability of quantum randomness (2012) (89)
- Coins, Quantum Measurements, and Turing's Barrier (2001) (86)
- Bio-steps beyond Turing. (2004) (78)
- Series Recursively Enumerable Reals and Chaitin Numbers (1997) (77)
- Experimental Evidence of Quantum Randomness Incomputability (2010) (73)
- Finite Versus Infinite: Contributions to an Eternal Dilemma (2000) (72)
- Most Programs Stop Quickly or Never Halt (2006) (70)
- On partial randomness (2006) (69)
- Computing a Glimpse of Randomness (2001) (68)
- A variant of the Kochen-Specker theorem localising value indefiniteness (2015) (67)
- Journal of Universal Computer Science (1994) (63)
- Proceedings of the Workshop on Multiset Processing: Multiset Processing, Mathematical, Computer Science, and Molecular Computing Points of View (2000) (62)
- Algorithmic Randomness, Quantum Physics, and Incompleteness (2004) (53)
- Recursively enumerable reals and Chaitin Omega numbers (1998) (51)
- Value-indefinite observables are almost everywhere (2013) (50)
- Is complexity a source of incompleteness? (2004) (49)
- Chaitin Numbers and Strong Reducibilities (1997) (48)
- Borel Normality and Algorithmic Randomness (1993) (48)
- Natural halting probabilities, partial randomness, and zeta functions (2006) (48)
- A characterization of c.e. random reals (2002) (47)
- Recursively enumerable reals and Chaitin &Ω numbers (2001) (46)
- Randomness as an Invariant for Number Representations (1994) (45)
- Physical versus computational complementarity. I (1997) (45)
- From Heisenberg to Gödel via Chaitin (2005) (45)
- Topology on words (2009) (44)
- Logic in Computer Science (1997) (42)
- Randomness And Complexity, from Leibniz To Chaitin (2007) (42)
- QUBO formulations for the graph isomorphism problem and related problems (2017) (37)
- Is independence an exception? (1994) (37)
- A New Measure of the Difficulty of Problems (2006) (36)
- Classical, quantum and biological randomness as relative unpredictability (2016) (35)
- Information and Complexity (1974) (35)
- Metric Lexical Analysis (1999) (34)
- A quantum random number generator certified by value indefiniteness (2010) (31)
- Finite state complexity (2011) (31)
- An Empirical Approach to the Normality of π (2012) (30)
- On the Unpredictability of Individual Quantum Measurement Outcomes (2014) (30)
- Series Chaitin Ω Numbers , Solovay Machines , and Incompleteness (1999) (28)
- Exact Approximations of omega Numbers (2007) (28)
- Reflections on quantum computing (2000) (27)
- Representation of left-computable ε-random reals (2011) (26)
- Mathematics: Randomness everywhere (1999) (26)
- Chaitin Omega Numbers and Strong Reducibilities (1997) (26)
- Bead-Sort: A Natural Sorting Algorithm (2002) (26)
- Finite nondeterministic automata: Simulation and minimality (2000) (25)
- A topological characterization of random sequences (2003) (24)
- Guest Column: Adiabatic Quantum Computing Challenges (2015) (24)
- Transcending the Limits of Turing Computability (2003) (24)
- DE-QUANTIZING THE SOLUTION OF DEUTSCH'S PROBLEM (2006) (24)
- Passages of Proof (2003) (24)
- Is the Universe Lawful (1996) (23)
- Additive Distances and Quasi-Distances Between Words (2002) (23)
- Program-size Complexity Computes the Halting Problem (1995) (23)
- A note on accelerated Turing machines (2010) (22)
- Unconventional Models of Computation, UMC’2K (2001) (21)
- Computing with cells and atoms in a nutshells (2000) (21)
- Degree-Theoretic Aspects of Computably Enumerable Reals (1998) (21)
- A Hybrid Quantum-Classical Paradigm to Mitigate Embedding Costs in Quantum Annealing (2018) (21)
- Strong Determinism vs. Computability (1994) (20)
- Kraft-Chaitin Inequality Revisited (1996) (20)
- Information and Randomness (2002) (19)
- Evaluating the Complexity of Mathematical Problems: Part 2 (2009) (19)
- Infinitesimal Probabilities Based on Grossone (2019) (19)
- Chaitin Omega numbers, Solovay machines, and Gödel incompleteness (2002) (19)
- Deterministic Automata: Simulation, Universality and Minimality (1997) (19)
- The Road to Quantum Computational Supremacy (2017) (18)
- Embedding Quantum Universes in Classical Ones (1999) (18)
- Von Neumann Normalisation of a Quantum Random Number Generator (2011) (18)
- Algorithmically independent sequences (2008) (18)
- J.UCS The Journal of Universal Computer Science (1996) (18)
- Algorithmically Coding the Universe (1993) (18)
- Global syntax and semantics for recursively enumerable languages (1981) (17)
- Experimentally probing the algorithmic randomness and incomputability of quantum randomness (2018) (17)
- Solving the Broadcast Time Problem Using a D-wave Quantum Computer (2017) (17)
- Mathematical Proofs at a Crossroad? (2004) (17)
- From Heisenberg to Gödel via Chaitin (2004) (16)
- Randomness on full shift spaces (2001) (16)
- The Complexity of the Four Colour Theorem (2010) (16)
- Rainbow of Computer Science - Dedicated to Hermann Maurer on the Occasion of His 70th Birthday (2011) (16)
- Finite Versus Infinite (2000) (16)
- The complexity of proving chaoticity and the Church-Turing thesis. (2010) (15)
- Unconventional Computation and Natural Computation (2015) (15)
- Computable Approximations of Reals: An Information-Theoretic Analysis (1998) (15)
- Evaluating the Complexity of Mathematical Problems: Part 1 (2009) (15)
- Incompleteness, Complexity, Randomness and Beyond (2001) (14)
- A Non-Probabilistic Model of Relativised Predictability in Physics (2015) (14)
- Understanding the Quantum Computational Speed-up via De-quantisation (2010) (14)
- Value Indefiniteness Is Almost Everywhere (2013) (12)
- A probabilistic anytime algorithm for the halting problem (2018) (12)
- Finite state incompressible infinite sequences (2014) (12)
- On universal computably enumerable prefix codes (2009) (12)
- Disjunctive Sequences: An Overview (1997) (12)
- A Multi-Criteria Metric Algorithm for Recommender Systems (2011) (12)
- Language-theoretic Complexity of Disjunctive Sequences (1997) (11)
- Universal recursively enumerable sets of strings (2008) (11)
- Finite-State Complexity and Randomness (2009) (11)
- Independent Instances for Some Undecidable Problems (1983) (11)
- Inductive Complexity Measures for Mathematical Problems (2013) (11)
- Combinatorics, Complexity and Logic (1999) (11)
- The first example of a recursive function which is not primitive recursive (1979) (11)
- Unconventional Computing: A Brief Subjective History (2017) (11)
- East-West paths to unconventional computing. (2017) (10)
- Quantum Randomness: From Practice to Theory and Back (2017) (10)
- Algorithmic Information Theory: Open Problems (1996) (10)
- Universality and Almost Decidability (2015) (10)
- Formal Proof: Reconciling Correctness and Understanding (2009) (10)
- Topological Size of Sets of Partial Recursive Functions (1982) (9)
- A new quantum random number generator certified by value indefiniteness (2020) (9)
- What is the Value of Taxicab(6)? (2003) (9)
- The Constructive Implicit Function Theorem and Applications in Mechanics (1997) (9)
- Proving and Programming (2007) (9)
- Computational Complementarity for Mealy Automata (1998) (9)
- Combinatorics, Computability and Logic (2001) (9)
- Computational Complementarity and Sofic Shifts (1997) (9)
- Is Quantum Randomness Algorithmic Random? A Preliminary Attack (2005) (9)
- Finite-State Complexity and the Size of Transducers (2010) (9)
- Anytime Algorithms for Non-Ending Computations (2015) (8)
- Every Computably Enumerable Random Real Is Provably Computably Enumerable Random (2008) (8)
- A Glimpse into Algorithmic Information Theory (1999) (8)
- Program-Size Complexity of Initial Segments and Domination Reducibility (1999) (8)
- A relation between correctness and randomness in the computation of probabilistic algorithms (1984) (8)
- Super-Exponentials Nonprimitive Recursive, but Rudimentary (1987) (8)
- Proving as a Computable Procedure (2005) (7)
- Strong noncomputability of random strings (1982) (7)
- Randomness relative to Cantor expansions (2003) (7)
- The Universe is Lawless or “Pantôn chrêmatôn metron anthrôpon einai” (2012) (7)
- What Is a Random String? (1995) (7)
- Combinatorics and Related Areas A Collection of Papers in Honour of the 65th Birthday of Ioan Tomescu (2007) (7)
- Information: The Algorithmic Paradigm (2009) (7)
- Spurious, Emergent Laws in Number Worlds (2018) (7)
- Randomness and Incompleteness (2002) (7)
- Classical , Quantum and Biological Randomness as Relative Incomputability (2014) (7)
- The Typical Number Is a Lexicon (1998) (7)
- Are binary codings universal? (1995) (7)
- Generalisations of disjunctive sequences (2005) (7)
- Solving SAT with Bilateral Computing (2002) (7)
- Liouville, Computable, Borel Normal and Martin-Löf Random Numbers (2018) (7)
- Effects of Kolmogorov Complexity Present in Inductive Inference as Well (1997) (7)
- Inductive Complexity of P versus NP Problem - Extended Abstract (2012) (7)
- On Recursive Bounds for the Exceptional Values in Speed-Up (1994) (6)
- Automata Recognizing No Words: A Statistical Approach (2006) (6)
- Balance Machines: Computing = Balancing (2003) (6)
- The complexity of Euler's integer partition theorem (2012) (6)
- Computing with Cells and Atoms: After Five Years (2004) (6)
- Kochen-Specker Theorem: Two Geometric Proofs (2014) (6)
- The Poincare-Hardy Inequality on the Complement of a Cantor Set (2002) (6)
- Optimal Agents ∗ (2005) (6)
- A machine learning PROGRAM to identify COVID-19 and other diseases from hematology data (2021) (5)
- Liouville Numbers, Borel Normality and Algorithmic Randomness (2013) (5)
- Relativized Topological Size of Sets of Partial Recursive Functions (1991) (5)
- Incompleteness and the Halting Problem (2021) (5)
- How Random Is Quantum Randomness? An Experimental Approach (2009) (5)
- Minimal Programs Are Almost Optimal (1999) (5)
- State-Size Hierarchy for Finite-State Complexity (2012) (5)
- A fast natural algorithm for searching (2004) (5)
- Proceedings of the 6th international conference on Unconventional Computation (2007) (5)
- Testing Computational Complementarity for Mermin Automata (1999) (5)
- Who Is Afraid of Randomness (2000) (5)
- The Complexity of Mathematical Problems: An Overview of Results and Open Problems (2011) (5)
- Quantum Correlations Conundrum: An Automata-Theoretic Approach (1999) (5)
- Recursive Baire Classification and Speedable Functions (1992) (5)
- Is Feasibility in Physics Limited by Fantasy Alone (2009) (5)
- Quantum solutions for densest k-subgraph problems (2020) (5)
- Quassical Computing (2018) (5)
- Do the Zeros of Riemann's Zeta-Function Form a Random Sequence? (1997) (4)
- Effective Category and Measure in Abstract Complexity Theory (1996) (4)
- Inductive Complexity of the P versus NP Problem (2013) (4)
- Preface to the Special Issue on Physics and Computation "Towards a Computational Interpretation of Physical Theories" (2012) (4)
- Computing: Parallel thinking (1998) (4)
- Computational complementarity for probabilistic automata (2001) (4)
- Pre-Proceedings of the Workshop on Multiset Processing (2000) (4)
- Is there a universal image generator? (2012) (4)
- People & ideas in theoretical computer science (1999) (4)
- Proceedings of the Second International Conference on Unconventional Models of Computation (2000) (4)
- Is the universe random (2011) (4)
- What is the Value of Taxicab(6)? An Update (2005) (4)
- Counterfactual Effect, the Halting Problem, and the Busy Beaver Function (1999) (4)
- Unconventional models of computation : Third International Conference, UMC 2002, Kobe, Japan, October 15-19, 2002 : proceedings (2002) (4)
- Counterfactual Effect, the Halting Problem, and the Busy Beaver Function (1999) (4)
- The jumble cruncher (2004) (4)
- Truth and Light: Physical Algorithmic Randomness (2005) (4)
- Free Will Is Compatible With Randomness (2016) (4)
- Coins, Quantum Measurements, and Turing's Barrier: Preliminary Version (2001) (4)
- Coding with Minimal Programs (2001) (4)
- Computing with New Resources (2014) (4)
- Constructivity, Computability, and Logic A Collection of Papers in Honour of the 60th Birthday of Douglas Bridges (2005) (4)
- On topologies generated by Moisil resemblance relations (1979) (4)
- The Human Face of Computing (2015) (3)
- How Random Is Quantum Randomness? (Extended Version) (2009) (3)
- Introduction to unconventional models of computation (1998) (3)
- On a theorem of Günter Asser (1990) (3)
- Complexity: A Language-Theoretic Point of View (1997) (3)
- Bi-immunity over different size alphabets (2021) (3)
- Note on the Topological Structure of Random Strings (1993) (3)
- Note on Ehrenfeucht's conjecture and Hilbert's basis theorem (1986) (3)
- Computing 80 Initial Bits of A Chaitin Omega Number (2000) (3)
- Solving Problems with Finite Test Sets (2000) (3)
- Breaking the Turing Barrier (1998) (3)
- Cdmtcs Research Report Series Embedding Quantum Universes into Classical Ones Embedding Quantum Universes into Classical Ones (1997) (3)
- On metrizability of the free monoids (1976) (3)
- Algorithmic Complexity of Mathematical Problems: An Overview of Results and Open Problems (2013) (3)
- Deterministic Automata: Simulation, Universality and Minimality. Extended Abstract (1997) (2)
- Effective Category and Measure in Abstract Complexity Theory (Extended Abstract) (1995) (2)
- Computing with New Resources: Essays Dedicated to Jozef Gruska on the Occasion of His 80th Birthday (2015) (2)
- Proceedings of the 4th international conference on Discrete mathematics and theoretical computer science (2003) (2)
- Can we solve the pipeline problem? (2014) (2)
- What perceptron neural networks are (not) good for? (2022) (2)
- Randomness Everywhere: My Path to Algorithmic Information Theory (2011) (2)
- Indeterminism and Randomness (2015) (2)
- Kochen-Specker Theorem Revisited and Strong Incomputability of Quantum Randomness (2012) (2)
- On a Theorem of Solovay (1999) (2)
- Entropic measures, Markov information sources and complexity (2002) (2)
- New Information Technologies in Higher Education. Studies on the Introduction of New Information Technologies in Higher Education in the Europe Region. (1989) (2)
- On representability of P. Martin-Löf tests (1983) (2)
- Bisimulations and behaviour of nondeterministic automata (1999) (2)
- Series Experimentally Probing the Incomputability of Quantum Randomness (2018) (2)
- Optimum Extendible Prefix Codes (1997) (2)
- What is a Random String (1996) (2)
- Computing exact approximations of a chaitin omega number (2004) (2)
- Spectral Representation of Some Computably Enumerable Sets with an Application to Quantum Provability (2013) (2)
- A statistical anytime algorithm for the Halting Problem (2020) (2)
- A genius's story: two books on Go¨del (1997) (2)
- Simplicity via provability for universal prefix-free Turing machines (2009) (2)
- Experimental Probing of the Incomputability of Quantum Randomness (2017) (2)
- Von Neumann Normalisation and Symptoms of Randomness: An Application to Sequences of Quantum Random Bits (2011) (2)
- Metric Based Recommender Systems (2012) (1)
- News from New Zealand (2013) (1)
- Searching for shortest and least programs (2020) (1)
- Computing with cells and atoms in a nutshell (2000) (1)
- Normality and the Digits of π (2012) (1)
- De-Quantising Non-Halting Programs (2006) (1)
- A genius's story: Two books on Gödel (1997) (1)
- Ehrenfeucht Test Set Theorem and Hilbert Basis Theorem: A Constructive Glimpse (1989) (1)
- An Observer-Based de-Quantisation of Deutsch's Algorithm (2011) (1)
- Incompleteness, Undecidability and Automated Proofs - (Invited Talk) (2016) (1)
- Unconventional Models of Computation, UMC'2K, Proceedings of the Second International Conference, Brussel, Belgium, 13-16 December 2000 (2001) (1)
- A Hybrid Quantum-Classical Paradigm to Mitigate Embedding Costs in Quantum Annealing - Abridged Version (2018) (1)
- An Interview with Erol Gelenbe (2011) (1)
- Most Short Programs Halt Quickly or Never Halt (2006) (1)
- Complementarity and the (Un)Predictability of Quantum Measurement Outcomes (2015) (1)
- The Bridge Crossing Problem (2002) (1)
- Developments In Language Theory: 8th International Conference, Dlt 2004, Auckland, New Zealand, December 13-17, Proceedings (Lecture Notes in Computer Science) (2005) (1)
- Liouville, Computable, Borel Normal and Martin-Löf Random Numbers (2017) (1)
- What is computation? (how) does nature compute? (2011) (1)
- To Halt, or Not to Halt. That Is the Question (2021) (1)
- Unconventional Computing, 7th International Conference, UC 2008, Vienna, Austria, August 25-28, 2008. Proceedings (2008) (1)
- Developments in Language Theory, 8th International Conference, DLT 2004, Auckland, New Zealand, December 13-17, 2004, Proceedings (2004) (1)
- Automata: From Uncertainty to Quantum (2001) (1)
- On Regular Language Factorisation : A Complete Solution for Unary Case (2004) (1)
- A Nuclear Magnetic Resonance Implementation of a Classical Deutsch-Jozsa Algorithm (2011) (1)
- Quantum Informatics and the Relations Between Informatics, Physics and Mathematics: A Dialogue (2007) (1)
- A Quantum Scattering Approach to Undecidable Problems: Preliminary Version (2002) (1)
- Representability of recursive P. Martin-Löf tests (1983) (1)
- On Demons and Oracles (2011) (1)
- Deterministic Frequency Pushdown Automata (2015) (1)
- Discrete mathematics and theoretical computer science : 4th International Conference, DMTCS 2003, Dijon, France, July 7-12, 2003 : proceedings (2003) (1)
- Incompleteness: A Personal Perspective (2008) (1)
- Series Universal Recursively Enumerable Sets of Strings (2009) (1)
- Determining and Stationary Sets for Some Classes of Partial Recursive Functions (1991) (1)
- Series Spurious , Emergent Laws in Number Worlds (2019) (0)
- Chaitinnumbers, Solovay machines, and G%odel incompleteness (2002) (0)
- Proceedings of the 8th international conference on Developments in Language Theory (2004) (0)
- Free Will and Randomness (2014) (0)
- Two Anytime Algorithms for the Halting Problem (2015) (0)
- Pre-proceedings of the Workshop Physics and Computation (2008) (0)
- Grzegorz Rozenberg: Natural Computing (2015) (0)
- Brian E. Carpenter: The Internet (2015) (0)
- Giuseppe Longo: Computations and Natural Sciences (2015) (0)
- Dedicated to G. J. Chaitin for his 50th Birthday Recursively Enumerable Reals and Chaitin Numbers? (1998) (0)
- WHAT IS THE VALUE OF TAXICAB(6)? Extended Abstract (2003) (0)
- CDMTCS Research Report Series Universal Recursively Enumerable Sets of Strings (0)
- Supplemental Papers for DLT04 (2004) (0)
- Rod Downey: Computability, Complexity Theory, Reverse Mathematics and Algorithmic Information Theory (2015) (0)
- MSC volume 22 issue 4 Cover and Back matter (2012) (0)
- A Dialogue on the Internet (2008) (0)
- Introduction (2009) (0)
- Êêòòóñòò×× Úöýûûûööö Óñôùøøøðý Òùññöööðð Êêêð× Òò Áò Blockinóñôððøøòò×× £ Öö×øøøò ˺ Ðùùù (2007) (0)
- Proc. 4th International Conference DMTCS'03 (2003) (0)
- Proceedings of the 7th international conference on Unconventional Computing (2008) (0)
- The 5th Anniversary Workshop on Discrete Mathematics and Theoretical Computer Science (2000) (0)
- Silicon, molecules, or photons (1998) (0)
- Three Theories of Computational Complexity Extended Abstract (1994) (0)
- Kraft-chaitin Inequality Revisited 1 (1996) (0)
- The Halting Problem Revisited (2012) (0)
- A Glimpse of Randomness (2002) (0)
- Developments in Language Theory (2008) (0)
- University Halle-Wittenberg Institute of Computer Science On Universal Computably Enumerable Prefix Codes (2008) (0)
- Series The Complexity of Mathematical Problems : An Overview of Results and Open Problems (2011) (0)
- Series Breaking the Turing Barrier (1998) (0)
- Liars, Demons, and Chaos (2001) (0)
- Series Representation of Left-Computable ε – Random (2009) (0)
- A class of nuniversal P Marti-Löf tests (1984) (0)
- 2 Proving vs . programming : today (2007) (0)
- Reinhard Wilhelm: Compiler Construction and Dagstuhl (2015) (0)
- The Finite, The Unbounded and The Infinite (1996) (0)
- Contagious Creativity: Preface (2004) (0)
- Call for Papers Eighth International Conference on DEVELOPMENTS IN LANGUAGE THEORY (DLT'04) (2004) (0)
- Mathematics Almost Everywhere: In Memory of Solomon Marcus (2018) (0)
- David Harel: From Theoretical Computer Science to Behavioural Programming, Biology and Smell (2015) (0)
- Supplemental Abstracts for DMTCS01 (2001) (0)
- Juris Hartmanis: Computational Complexity (2015) (0)
- Bucharest school of theoretical computer science (2014) (0)
- D ec 2 00 1 Incompleteness , Complexity , Randomness and Beyond (0)
- Quantum Universality and Turing Completeness (2018) (0)
- Series Abstracts : Constructivity , Complexity , and Fuzziness ( CCF ’ 99 ) (1999) (0)
- MSC volume 23 issue 5 Cover and Back matter (2013) (0)
- Pocket Mathematics (1994) (0)
- Series Two Anytime Algorithms for the Halting Problem (2015) (0)
- Series Bisimulations and Behaviour of Nondeterministic Automata (1999) (0)
- Series Value Indefiniteness Is Almost Everywhere (2013) (0)
- A Simple Construction of Absolutely Disjunctive Liouville Numbers (2018) (0)
- BASIS THEOREM : A CONSTRUCTIVE GLIMPSE (2005) (0)
- Erol Gelenbe: Computer System and Network Performance Analysis (2015) (0)
- Contagious Creativity (2005) (0)
- Quantum Random Numbers : Certification and Generation (2011) (0)
- Series Infinitesimal Probabilities Based on Grossone (2019) (0)
- Cdmtcs Research Report Series Testing Computational Complementarity for Mermin Automata Testing Computational Complementarity for Mermin Automata (1999) (0)
- 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 (2010) (0)
- News from New Zealand / Group-Theoretic Methods for Designing Networks (1998) (0)
- Combinatorics, Computability and Logic Proceedings of the Third International Conference on Combinatorics, Computability and Logic (2001) (0)
- The Collatz Problem ∗ , the Halting Problem and Randomness (2014) (0)
- Unconventional Computation: 5th International Conference, UC 2006, York, UK, September 4-8, 2006, Proceedings (Lecture Notes in Computer Science) (2006) (0)
- Probabilistic Mobility Models for Mobile and Wireless Networks (2018) (0)
- Solomon Marcus: Mathematical Analysis, Languages and Fractals (2015) (0)
- Arto Salomaa: Theoretical Computer Science (2015) (0)
- Moshe Y. Vardi: From Theory and Practice in Computing to Research Ethics and the Surveillance State (2015) (0)
- CDMTCS Research Report Series On Partial Randomness (2004) (0)
- Preface (2006) (0)
- Dines Bjørner: Formal Methods Professor (2015) (0)
- CDMTCS Research Report Series Who Is Afraid of Randomness ? (2000) (0)
- Recursively Enumerable Instantaneous Codes (1994) (0)
- Series Workshop on Truths and Proofs (2001) (0)
- Series Complexity : A Language-- Theoretic Point of View (1995) (0)
- The Deluge of Spurious Correlations in Big Data (2016) (0)
- Algorithmic versus Quantum Randomness (2007) (0)
- Solomon Marcus Contributions to Theoretical Computer Science and Applications (2021) (0)
- Real Numbers: From Computable to Random (2000) (0)
- Quantum Information with Meaning Inside and Outside the Quantum (2015) (0)
- Introduction: computability of the physical (2012) (0)
- Series Incompleteness : A Personal Perspective (2008) (0)
- Joseph Sifakis: Concurrent Systems Specification and Verification (2015) (0)
- A Dialogue on Mathematics and Physics (2006) (0)
- Normality and Martin-Löf Randomness (2016) (0)
- Research Report Series Topology on Words (2008) (0)
- Hermann Maurer: Computing and Thinking about the Future (2015) (0)
- Yuri Manin: My Life Is Not a Conveyor Belt (2015) (0)
- The Bridge Crossing Problem: Draft Form (2001) (0)
- Open Discussion on A Computable Universe (2012) (0)
- Series Finite-State Complexity and Randomness (2010) (0)
- Series A Glimpse into Natural Computing (1999) (0)
- Computably Enumerable Instantaneous Codes (2002) (0)
- Solomon Marcus, 1925-2016 (2016) (0)
- A Dialogue with Yuri Gurevich about Mathematics, Computer Science and Life (2017) (0)
- Most short programs halt quickly (2006) (0)
- Unconventional Computation, 4th International Conference, UC 2005, Sevilla, Spain, October 3-7, 2005, Proceedings (2005) (0)
- Series Computing with Cells and Atoms : After Five Years (2004) (0)
- Jozef Gruska: Informatics, Physics and Mathematics (2015) (0)
- Introduction (2009) (0)
- Joseph F. Traub: Information-Based Complexity (2015) (0)
- Series Computational Complementarity for Mealy Automata (1998) (0)
- Series A Note on Accelerated Turing Machines (2009) (0)
- Chaitin Celebration at the NKS2007 Conference (2007) (0)
- Purchase of Archive Editions and Printed Special Issues: I-know'04 4th International Conference on Knowledge Management Applications 0/ Knowledge Management 4 12 19 Learning Northern Ireland: a Very Large Elearning Project a Proposed Knowledge Framework for Pricing Negotiation on Organizational Proc (2004) (0)
- What Is a Random String ? Extended (2007) (0)
- Recursivelyenumerable reals and Chaitinnumbers (2001) (0)
- Series On Universal Computably Enumerable Prefix Codes (2007) (0)
- Unconventional computation and natural computation : 14th international conference, UCNC 2015, Auckland, New Zealand, August 30-September 3, 2015 : proceedings (2015) (0)
- Douglas Bridges: Constructive Mathematics (2015) (0)
- ar X iv : m at h . H O / 0 30 52 13 v 2 1 1 A ug 2 00 4 Passages of Proof (2005) (0)
- A Fast Natural Algorithm for Searching: Preliminary version (2003) (0)
- CDMTCS Research Report Series Is the Universe Lawful ? (1996) (0)
- Those Who Most Ignore, Least Escape (1995) (0)
- Ja n 20 07 Most Programs Stop Quickly or Never Halt (2021) (0)
- Dialogues on Quantum Computing (2004) (0)
- 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 (2002) (0)
- Eric Goles: Systems, Art and CONICYT (2015) (0)
- Series Degree-Theoretic Aspects of Computably Enumerable Reals (1998) (0)
- Series Randomness on Full Shift Spaces (1999) (0)
- Series Deterministic Frequency Pushdown Automata (2013) (0)
- Computably Enumerable Random Reals (2002) (0)
- List of Authors (2018) (0)
- Series Free Will and Randomness (2014) (0)
- Acknowledgement (2010) (0)
- Incompleteness and the Halting Problem (2021) (0)
- Preface to the Special Issue Unconventional Computing 2008 (2010) (0)
- Series Incompleteness , Complexity , Randomness and Beyond (2002) (0)
- Preface (2005) (0)
- Preface (2014) (0)
- Normality and Algorithmic Randomness (2013) (0)
- Series Reflections on Quantum Computing (2000) (0)
- Discrete mathematical structures: From dynamics to complexity (2013) (0)
- Gödel Incompleteness and Proof-Assistants Extended Abstract (2021) (0)
- Workshop on Truths and Proofs (2001) (0)
- Mioara Mugur-Schachter: Information, Quantum Mechanics and Probabilities (2015) (0)
- Gregory Chaitin: Mathematics, Physics, Biology and Philosophy (2015) (0)
- Chaitin Numbers and (1998) (0)
- CDMTCS Research Report Series Long and Short Proofs (2022) (0)
- Opening the Book of Randomness (Extended Version) (2010) (0)
- Unconventional Computation : 8th International Conference, UC 2009, Ponta Delgada, Portugal, September 7-11, 2009. Proceedings (2009) (0)
- Supplemental Papers for DMTCS03 (2003) (0)
- Series Automata Recognizing No Words : A Statistical Approach (2004) (0)
- 03 04 12 8 v 2 1 1 M ay 2 00 3 Transcending the Limits of Turing Computability ∗ (1998) (0)
- Can Randomness Be Certified by Proof (2008) (0)
- What Is a Random String? 1 2 (1995) (0)
- Formal Proofs for AIT (2016) (0)
- An Interview with Erol Gelenbe (2010) (0)
- The Computation of Finite-State Complexity by Tania K . Roblot (2011) (0)
- Series Can We Solve the Pipeline Problem ? (2014) (0)
- Abstracts of Constructivity, Complexity, and Fuzziness (CCF '99) (1999) (0)
- On a class of independent problems related to Rice theorem (1983) (0)
- Automata, Logic, and Computability: J.UCS Special Issue Dedicated to Professor Sergiu Rudeanu Festschrift (2000) (0)
- AIT Based Randomness Testing of Quantum Random Bits (2017) (0)
- Research Report Series From Heisenberg to Gödel via Chaitin (2004) (0)
- Jon Borwein: Experimental Mathematics (2015) (0)
- Supplemental Papers for the 2nd Unconventional Models of Computation Conference (2000) (0)
- Ian H. Witten: A Stroll Through the Gardens of Computer Science (2015) (0)
- Series Generalisations of Disjunctive Sequences (2004) (0)
- Randomness on full shift spaces q (1999) (0)
- Pi_1-Statements, Chaotic Systems and the Church-Turing Thesis (2010) (0)
- Françoise Chatelin: Qualitative Computing (2015) (0)
- MSC volume 21 issue 5 Cover and Back matter (2011) (0)
- Editorial (2016) (0)
- A Note on Pseudorandom Generators (1998) (0)
- Algorithms for Non-Ending Computations (2015) (0)
- Yuri Gurevich: Mathematics, Computer Science and Life (2015) (0)
- Series Is there a Universal Image Generator ? (2009) (0)
- Proc. 8th International Conference on Developments in Language Theory, DLT'04 (2004) (0)
- Series Minimal Programs Are Almost Optimal (1999) (0)
- Foreword (2007) (0)
- A pr 2 00 3 Transcending the Limits of Turing Computability ∗ (1998) (0)
- Series Passages of Proof (2004) (0)
- Formulations for the Graph Isomorphism Problem and Related Problems (2017) (0)
- Series A Note on Pseudorandom Generators (1998) (0)
- Series Bead { Sort : A Natural Sorting Algorithm (2002) (0)
- Paleoclimatic records from Holocene speleothems of SW Angola (2003) (0)
- Quantum Theory: from foundations to technologies the (2015) (0)
- Report Series Photonic Ternary Quantum Random Number Generators (2022) (0)
- Dedicated to G . J . Chaitin for his 50 th Birthday Recurs ive ly Enumerable Reals and Chait in Y 2 Numbers * (2005) (0)
- Quantum Molinism (2022) (0)
- Chaitin $\Omega$ Numbers, Solovay Machines, and Incompleteness (1999) (0)
- Classical, quantum and biological randomness as relative unpredictability (2015) (0)
- CDMTCS Research Report Series Photonic Ternary Quantum Number Generators (2022) (0)
- Author ' s personal copy Is there a universal image generator ? (2012) (0)
- Complexity and Incompleteness (2008) (0)
This paper list is powered by the following services:
Other Resources About Cristian S. Calude
What Schools Are Affiliated With Cristian S. Calude?
Cristian S. Calude is affiliated with the following schools:
