Presentations of computably enumerable reals.

DOI10.1016/S0304-3975(01)00110-4zbMath1039.03034MaRDI QIDQ1607305

Geoffrey L. LaForte, Rodney G. Downey

Publication date: 31 July 2002

Published in: Theoretical Computer Science (Search for Journal in Brave)

zbMATH Keywords

PresentationComputably enumerable realsKraft-Chaitin

Mathematics Subject Classification ID

Theory of numerations, effectively presented structures (03D45)

Related Items

Randomness and reducibility ⋮ Genericity of weakly computable objects ⋮ Minimal Weak Truth Table Degrees and Computably Enumerable Turing Degrees ⋮ Random reals and possibly infinite computations Part I: Randomness in ∅′ ⋮ On 0′-computable reals ⋮ Computability of Real Numbers ⋮ Chaitin \(\Omega\) numbers, Solovay machines, and Gödel incompleteness.

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Classification of degree classes associated with r.e. subspaces
• On the continued fraction representation of computable real numbers
• Computational complexity of real functions
• Relatively recursive reals and real functions
• From axiomatics to intrinsic characterization: some open problems in computable analysis
• Cohesive sets and recursively enumerable Dedekind cuts
• An Algebraic Decomposition of the Recursively Enumerable Degrees and the Coincidence of Several Degree Classes with the Promptly Simple Degrees
• Recursively enumerable generic sets
• A Theory of Program Size Formally Identical to Information Theory
• Recursion Theory and Dedekind Cuts
• The definition of random sequences
• Recursive Real Numbers