Classification of computably approximable real numbers

DOI10.1007/s00224-007-9026-5zbMath1176.03020OpenAlexW1999739638MaRDI QIDQ1015380

Zheng, Xizhong

Publication date: 8 May 2009

Published in: Theory of Computing Systems (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00224-007-9026-5

zbMATH Keywords

computabilityhierarchycomputable real numberscomputably approximable real numbers

Mathematics Subject Classification ID

Constructive and recursive analysis (03F60) Computation over the reals, computable analysis (03D78) Hierarchies of computability and definability (03D55)

Related Items

Computability of Real Numbers

Cites Work

• Divergence bounded computable real numbers
• Constructive mathematics: a foundation for computable analysis
• Cohesive sets and recursively enumerable Dedekind cuts
• Closure properties of real number classes under CBV functions
• Weak computability and representation of reals
• TWO RECURSIVELY ENUMERABLE SETS OF INCOMPARABLE DEGREES OF UNSOLVABILITY (SOLUTION OF POST'S PROBLEM, 1944)
• A General Framework for Priority Arguments
• On Computable Numbers, with an Application to the Entscheidungsproblem
• Nicht konstruktiv beweisbare Sätze der Analysis
• Criteria of constructibility for real numbers
• Recursive Real Numbers
• Weakly computable real numbers
• Recursively enumerable reals and Chaitin \(\Omega\) numbers
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item