On the hierarchy and extension of monotonically computable real numbers.

DOI10.1016/S0885-064X(03)00066-9zbMath1043.03037MaRDI QIDQ1426053

Robert Rettinger, Zheng, Xizhong

Publication date: 14 March 2004

Published in: Journal of Complexity (Search for Journal in Brave)

zbMATH Keywords

dense hierarchymonotonically computable real numbersrecursively approximable real numbersweakly computable real numbers

Mathematics Subject Classification ID

Constructive and recursive analysis (03F60) Higher-type and set recursion theory (03D65)

Related Items (3)

On Turing degrees of points in computable topology ⋮ On the hierarchies of Δ₂⁰-real numbers ⋮ Divergence bounded computable real numbers

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• The closure properties on real numbers under limits and computable operators.
• Cohesive sets and recursively enumerable Dedekind cuts
• Randomness and Recursive Enumerability
• A computable ordinary differential equation which possesses no computable solution
• A Theory of Program Size Formally Identical to Information Theory
• Recursion Theory and Dedekind Cuts
• The definition of random sequences
• On Computable Numbers, with an Application to the Entscheidungsproblem
• Nicht konstruktiv beweisbare Sätze der Analysis
• Recursive Real Numbers
• Weakly computable real numbers
• Recursively enumerable reals and Chaitin \(\Omega\) numbers
• A characterization of c. e. random reals

This page was built for publication: On the hierarchy and extension of monotonically computable real numbers.