The approximation structure of a computably approximable real

DOI10.2178/jsl/1058448447zbMath1056.03040OpenAlexW2004706162MaRDI QIDQ4650263

George Barmpalias

Publication date: 9 February 2005

Published in: Journal of Symbolic Logic (Search for Journal in Brave)

Full work available at URL: https://projecteuclid.org/euclid.jsl/1058448447

Mathematics Subject Classification ID

Constructive and recursive analysis (03F60) Other degrees and reducibilities in computability and recursion theory (03D30)

Related Items (2)

Approximation representations for \(\Delta_2\) reals ⋮ Hypersimplicity and semicomputability in the weak truth table degrees

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Classical recursion theory. The theory of functions and sets of natural numbers
• Relatively recursive reals and real functions
• Computational complexity, speedable and levelable sets

This page was built for publication: The approximation structure of a computably approximable real