The mathematical theory of information
- Cristian S. Calude
- Mathematics
- 1 December 2007
Information and Randomness: An Algorithmic Perspective
- Cristian S. Calude
- Computer Science
- 1994
Information and Randomness
- Cristian S. Calude
- Mathematics, Computer ScienceMonographs in Theoretical Computer Science An…
- 1994
Deciding parity games in quasipolynomial time
- Cristian S. Calude, Sanjay Jain, B. Khoussainov, Wei Li, F. Stephan
- Computer Science, MathematicsSymposium on the Theory of Computing
- 19 June 2017
It is shown that the parity game can be solved in quasipolynomial time and it is proven that coloured Muller games with n nodes and m colours can be decided in time O((mm · n)5); it is also shown that this bound cannot be improved to O((2m · n), for any c, unless FPT = W[1].
On partial randomness
- Cristian S. Calude, L. Staiger, S. Terwijn
- Mathematics, Computer ScienceAnnals of Pure and Applied Logic
- 1 March 2006
The Deluge of Spurious Correlations in Big Data
- Cristian S. Calude, G. Longo
- Computer Science
- 1 September 2017
It is proved that very large databases have to contain arbitrary correlations, and can be found in “randomly” generated, large enough databases, whichimplies that most correlations are spurious.
Strong Kochen-Specker theorem and incomputability of quantum randomness
- A. Abbott, Cristian S. Calude, Jonathan Conder, K. Svozil
- MathematicsPhysical Review A
- 9 July 2012
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…
Series Recursively Enumerable Reals and Chaitin Numbers
- Cristian S. Calude, Peter Hertling, B. Khoussainov, Yongge Wang
- Mathematics
- 1997
A real is called recursively enumerable if it can be approximated by an increasing, recursive sequence of rationals. The halting probability of a universal selfdelimiting Turing machine (Chaitin's…
Chaitin Numbers and Strong Reducibilities
- Cristian S. Calude, A. Nies
- Mathematics
- 1997
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. In this way we obtain a whole class of natural…
Degree-Theoretic Aspects of Computably Enumerable Reals
- Cristian S. Calude, R. Coles, Peter Hertling, B. Khoussainov
- Computer Science
- 1 September 1998
...
...