A hierarchy of Turing degrees of divergence bounded computable real numbers
From MaRDI portal
Publication:864432
DOI10.1016/J.JCO.2006.04.009zbMATH Open1113.03038OpenAlexW2060630952MaRDI QIDQ864432FDOQ864432
Authors: Robert Rettinger, Xizhong Zheng 
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
Recommendations
- New Computational Paradigms
- On the divergence bounded computable real numbers
- Bounded Computable Enumerability and Hierarchy of Computably Enumerable Reals
- Publication:4938551
- Mathematical Foundations of Computer Science 2003
- Finitely bounded effective computability
- \(\Pi_1^0\) classes and minimal degrees
- On the Turing Degrees of Weakly Computable Real Numbers
- Classification of computably approximable real numbers
- Spectrum of the field of computable real numbers
Other Turing degree structures (03D28) Applications of computability and recursion theory (03D80) Constructive and recursive analysis (03F60)
Cites Work
- Weakly computable real numbers
- On Computable Numbers, with an Application to the Entscheidungsproblem
- Title not available (Why is that?)
- Cohesive sets and recursively enumerable Dedekind cuts
- On the Turing Degrees of Weakly Computable Real Numbers
- On the divergence bounded computable real numbers
- Degrees of d. c. e. reals
- Weak computability and representation of reals
- Title not available (Why is that?)
- New Computational Paradigms
Cited In (6)
This page was built for publication: A hierarchy of Turing degrees of divergence bounded computable real numbers
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q864432)
