On 0′-computable reals

DOI10.1016/S1571-0661(04)80374-8zbMath1261.03161OpenAlexW2017584560MaRDI QIDQ4916179

George Barmpalias

Publication date: 19 April 2013

Published in: Electronic Notes in Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s1571-0661(04)80374-8

Mathematics Subject Classification ID

Constructive and recursive analysis (03F60) Computation over the reals, computable analysis (03D78)

Related Items (1)

On 0′-computable reals

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Relatively recursive reals and real functions
• Classical recursion theory. Vol. II
• Presentations of computably enumerable reals.
• Computational complexity, speedable and levelable sets
• On 0′-computable reals
• Recursion Theory and Dedekind Cuts

This page was built for publication: On 0′-computable reals