Cristian S. Calude

Publications430
h-index34
Citations5,138
Highly Influential Citations272
Author pages are created from data sourced from our academic publisher partnerships and public sources.

Recommended Authors

  • K. Svozil
  • 298 Publications, 2,825 Citations
  • G. Chaitin
  • 182 Publications, 8,952 Citations
  • L. Staiger
  • 154 Publications, 2,120 Citations
  • E. Calude
  • 61 Publications, 377 Citations
  • Publications
  • Influence
The mathematical theory of information
  • 452
  • 44
Information and Randomness: An Algorithmic Perspective
TLDR
The book presents in a mathematical clear way the fundamentals of algorithmic information theory and a few selected applications. Expand
  • 376
  • 31
Information and Randomness
  • Cristian S. Calude
  • Mathematics, Computer Science
  • Monographs in Theoretical Computer Science An…
  • 1994
  • 246
  • 21
Chaitin Numbers and Strong Reducibilities
TLDR
We prove that any Chaitin Ω number (i.e., the halting probability of a universal self-delimiting Turing machine) is wtt-complete, but not tt-complete. Expand
  • 47
  • 9
  • PDF
On partial randomness
TLDR
We study the degree of randomness of sequences or reals by measuring their “degree o fc ompression”. Expand
  • 73
  • 8
  • PDF
Strong Kochen-Specker theorem and incomputability of quantum randomness
The Kochen-Specker theorem shows the impossibility for a hidden variable theory to consistently assign values to certain (finite) sets of observables in a way that is non-contextual and consistent… Expand
  • 64
  • 8
  • PDF
Computing with Cells and Atoms: An Introduction to Quantum, DNA and Membrane Computing
1. Prerequisites 1.1. Preliminary Notions and Notations 1.2. Operations on Strings and Languages 1.3. A General Computing Framework 1.4. Chomsky Grammars 1.5. Lindenmayer Systems 1.6. Automata and… Expand
  • 125
  • 7
  • PDF
The Deluge of Spurious Correlations in Big Data
TLDR
We show that very large databases have to contain arbitrary correlations. Expand
  • 135
  • 7
  • PDF
Deciding parity games in quasipolynomial time
TLDR
It is shown that the parity game - with n nodes and m distinct values (aka colours or priorities) - can be solved in quasipolynomial time. Expand
  • 134
  • 6
  • PDF
Theories of computational complexity
  • 90
  • 6