On the Turing Degrees of Weakly Computable Real Numbers

DOI10.1093/logcom/13.2.159zbMath1054.03040OpenAlexW2087699091MaRDI QIDQ4461928

Zheng, Xizhong

Publication date: 18 May 2004

Published in: Journal of Logic and Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1093/logcom/13.2.159

zbMATH Keywords

computable analysisTuring degreecomputably enumerable reals

Mathematics Subject Classification ID

Constructive and recursive analysis (03F60) Applications of computability and recursion theory (03D80) Other Turing degree structures (03D28)

Related Items (6)

A hierarchy of Turing degrees of divergence bounded computable real numbers ⋮ L 2 -Betti numbers and computability of reals ⋮ Finitely Bounded Effective Computability ⋮ On the hierarchies of Δ₂⁰-real numbers ⋮ Computability of Real Numbers ⋮ Divergence bounded computable real numbers

This page was built for publication: On the Turing Degrees of Weakly Computable Real Numbers