Every computably enumerable random real is provably computably enumerable random
From MaRDI portal
Publication:3391740
DOI10.1093/jigpal/jzp015zbMath1178.03057DBLPjournals/igpl/CaludeH09arXiv0808.2220OpenAlexW2083648745WikidataQ57001570 ScholiaQ57001570MaRDI QIDQ3391740
Nicholas J. Hay, Cristian S. Calude
Publication date: 12 August 2009
Published in: Logic Journal of IGPL (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/0808.2220
Recursively (computably) enumerable sets and degrees (03D25) Algorithmic randomness and dimension (03D32)
Related Items (4)
Simplicity via provability for universal prefix-free Turing machines ⋮ Representation of left-computable \(\varepsilon \)-random reals ⋮ Formal Proof: Reconciling Correctness and Understanding ⋮ Incompleteness, Undecidability and Automated Proofs
This page was built for publication: Every computably enumerable random real is provably computably enumerable random