The approximation structure of a computably approximable real
From MaRDI portal
Publication:4650263
Recommendations
- On approximate and algebraic computability over the real numbers
- Classification of computably approximable real numbers
- A new approach to computability over the reals
- scientific article; zbMATH DE number 1183247
- Effective simultaneous approximability of reals.
- Logical Approaches to Computational Barriers
- scientific article; zbMATH DE number 1191234
- Presentations of computably enumerable reals.
- scientific article; zbMATH DE number 1850721
- Relatively computably enumerable reals
Cites work
- scientific article; zbMATH DE number 1746031 (Why is no real title available?)
- scientific article; zbMATH DE number 1834658 (Why is no real title available?)
- scientific article; zbMATH DE number 1834682 (Why is no real title available?)
- scientific article; zbMATH DE number 1850721 (Why is no real title available?)
- Classical recursion theory. The theory of functions and sets of natural numbers
- Computational complexity, speedable and levelable sets
- Relatively recursive reals and real functions
Cited in
(10)- scientific article; zbMATH DE number 1183247 (Why is no real title available?)
- Processes and structures on approximation spaces
- scientific article; zbMATH DE number 1850721 (Why is no real title available?)
- Approximation representations for \(\Delta_2\) reals
- Classification of computably approximable real numbers
- Approximation representations for reals and their wtt‐degrees
- Classification of the computable approximations by divergence boundings
- Effective simultaneous approximability of reals.
- Hypersimplicity and semicomputability in the weak truth table degrees
- Approximating the existential theory of the reals
This page was built for publication: The approximation structure of a computably approximable real
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4650263)
