Bounded Computable Enumerability and Hierarchy of Computably Enumerable Reals

DOI10.1007/978-3-540-73545-8_33zbMATH Open1155.03028OpenAlexW1480530468MaRDI QIDQ3608858

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

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

Related Items (7)

Effectively infinite classes of numberings of computable families of reals ⋮ A Note on the Differences of Computably Enumerable Reals ⋮ TOTALLY ω-COMPUTABLY ENUMERABLE DEGREES AND BOUNDING CRITICAL TRIPLES ⋮ Title not available (Why is that?) ⋮ New Computational Paradigms ⋮ Recursively enumerable reals and Chaitin \(\Omega\) numbers ⋮ Presentations 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)