Bounded Computable Enumerability and Hierarchy of Computably Enumerable Reals

DOI10.1007/978-3-540-73545-8_33MaRDI QIDQ3608858zbMATH OpenOpenAlexFDO

Authors Xizhong Zheng

Publication date 6 March 2009

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-540-73545-8_33

zbMATH Keywords

c.e. setsErshov's hierarchyc.e. realsbounded c.e. reals

Mathematics Subject Classification ID

Theory of numerations, effectively presented structures (03D45) Hierarchies of computability and definability (03D55) Constructive and recursive analysis (03F60)

Recommendations

• scientific article; zbMATH DE number 1222611
• Publication:4941886
• On the divergence bounded computable real numbers
• Divergence bounded computable real numbers
• A hierarchy of computably enumerable degrees

Cited in

(8)

• TOTALLY ω-COMPUTABLY ENUMERABLE DEGREES AND BOUNDING CRITICAL TRIPLES
• Effectively infinite classes of numberings of computable families of reals
• scientific article; zbMATH DE number 5635093 (Why is no real title available?)
• New Computational Paradigms
• A hierarchy of Turing degrees of divergence bounded computable real numbers
• Recursively enumerable reals and Chaitin \(\Omega\) numbers
• Presentations of computably enumerable reals.
• A Note on the Differences of Computably Enumerable Reals

This page was built for publication: Bounded Computable Enumerability and Hierarchy of Computably Enumerable Reals

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