A hierarchy of Turing degrees of divergence bounded computable real numbers

DOI10.1016/J.JCO.2006.04.009zbMath1113.03038OpenAlexW2060630952MaRDI QIDQ864432

Robert Rettinger, Zheng, Xizhong

Publication date: 8 February 2007

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

Full work available at URL: https://doi.org/10.1016/j.jco.2006.04.009

zbMATH Keywords

divergence bounded computable realshierachyTuring degree of reals

Mathematics Subject Classification ID

Constructive and recursive analysis (03F60) Applications of computability and recursion theory (03D80) Other Turing degree structures (03D28)

Related Items (2)

Finitely Bounded Effective Computability ⋮ Computability of Real Numbers

Cites Work

• Unnamed Item
• Unnamed Item
• Cohesive sets and recursively enumerable Dedekind cuts
• On the Divergence Bounded Computable Real Numbers
• Degrees of d. c. e. reals
• Weak computability and representation of reals
• On the Turing Degrees of Weakly Computable Real Numbers
• New Computational Paradigms
• On Computable Numbers, with an Application to the Entscheidungsproblem
• Weakly computable real numbers

This page was built for publication: A hierarchy of Turing degrees of divergence bounded computable real numbers