Every computably enumerable random real is provably computably enumerable random
Work
Year: 2009
Type: article
Abstract: 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 that “a real is c.e. ... more
Source: Logic Journal of IGPL
Authors Cristian S. Calude, Nicholas Hay
Institution University of Auckland
Cites: 16
Cited by: 7
Related to: 10
FWCI: 1.202
Citation percentile (by year/subfield): 56.22
Subfield: Computational Theory and Mathematics
Field: Computer Science
Domain: Physical Sciences
Open Access status: green