11 citations · 12 across the 4 of their papers we have counts for
4 papers
Every Computably Enumerable Random Real Is Provably Computably Enumerable Random
Cristian S. Calude, Nicholas J. Hay
We prove that every computably enumerable (c.e.) random real is provable in Peano Arithmetic (PA) to be c.e. random. A major step in the proof is to show that the theorem stating t…
Algorithmically independent sequences
Cristian Calude, Marius Zimand
Two objects are independent if they do not affect each other. Independence is well-understood in classical information theory, but less in algorithmic information theory. Working i…
A Light-Based Device for Solving the Hamiltonian Path Problem
Mihai Oltean
In this paper we suggest the use of light for performing useful computations. Namely, we propose a special device which uses light rays for solving the Hamiltonian path problem on…
Computing A Glimpse of Randomness
Cristian S. Calude, Michael J. Dinneen, Chi-Kou Shu
A Chaitin Omega number is the halting probability of a universal Chaitin (self-delimiting Turing) machine. Every Omega number is both computably enumerable (the limit of a computab…