Weak computability and representation of reals

DOI10.1002/MALQ.200310110MaRDI QIDQ3159428zbMATH OpenOpenAlexFDO

Authors Xizhong Zheng, Robert Rettinger

Publication date 16 February 2005

Published in Mathematical Logic Quarterly (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1002/malq.200310110

zbMATH Keywords

binary expansionCauchy sequencecomputable realDedekind cutErshov's hierarchyweakly computable real

Mathematics Subject Classification ID

Hierarchies of computability and definability (03D55) Constructive and recursive analysis (03F60)

Recommendations

• Logical Approaches to Computational Barriers
• Weakly computable real numbers
• Primitive recursive real numbers
• Mathematical Foundations of Computer Science 2003
• scientific article; zbMATH DE number 4135939

Cited in

(16)

• Classification of computably approximable real numbers
• Approximation representations for reals and their wtt‐degrees
• scientific article; zbMATH DE number 4135939 (Why is no real title available?)
• On the Representations of NC and Log-Space Real Numbers
• scientific article; zbMATH DE number 1796999 (Why is no real title available?)
• Finitely bounded effective computability
• Primitive recursiveness of real numbers under different representations
• Classification of the computable approximations by divergence boundings
• A note on p-adic simplicial volumes
• Computability of Real Numbers
• On the weak computability of continuous real functions
• Mathematical Foundations of Computer Science 2003
• On the hierarchies of Δ₂⁰-real numbers
• Logical Approaches to Computational Barriers
• Weakly computable real numbers
• A hierarchy of Turing degrees of divergence bounded computable real numbers

This page was built for publication: Weak computability and representation of reals

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