A hierarchy of Turing degrees of divergence bounded computable real numbers
From MaRDI portal
(Redirected from Publication:864432)
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
Cites work
- scientific article; zbMATH DE number 1850721 (Why is no real title available?)
- scientific article; zbMATH DE number 2204767 (Why is no real title available?)
- Cohesive sets and recursively enumerable Dedekind cuts
- Degrees of d. c. e. reals
- New Computational Paradigms
- On Computable Numbers, with an Application to the Entscheidungsproblem
- On the Turing Degrees of Weakly Computable Real Numbers
- On the divergence bounded computable real numbers
- Weak computability and representation of reals
- Weakly computable real numbers
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)