On the Turing Degrees of Weakly Computable Real Numbers

DOI10.1093/LOGCOM/13.2.159MaRDI QIDQ4461928zbMATH OpenOpenAlexFDO

Authors Xizhong Zheng

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 analysiscomputably enumerable realsTuring degree

Mathematics Subject Classification ID

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

Recommendations

• Degrees of d. c. e. reals
• On 0'-computable reals
• Weakly computable real numbers
• scientific article; zbMATH DE number 1405572
• Logical Approaches to Computational Barriers

Cited in

(19)

• On the differences and sums of strongly computably enumerable real numbers
• Approximation representations for reals and their wtt‐degrees
• scientific article; zbMATH DE number 1222611 (Why is no real title available?)
• scientific article; zbMATH DE number 1796998 (Why is no real title available?)
• scientific article; zbMATH DE number 1796999 (Why is no real title available?)
• Regular reals
• On 0'-computable reals
• On sparseness and Turing reducibility over the reals
• Finitely bounded effective computability
• scientific article; zbMATH DE number 1405572 (Why is no real title available?)
• scientific article; zbMATH DE number 1405689 (Why is no real title available?)
• Computability of Real Numbers
• On the hierarchies of Δ₂⁰-real numbers
• New Computational Paradigms
• Logical Approaches to Computational Barriers
• Weakly computable real numbers
• L 2 -Betti numbers and computability of reals
• Divergence bounded computable real numbers
• A hierarchy of Turing degrees of divergence bounded computable real numbers

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4461928)