Abstract
In §1.6 we constructed a noncomputable c.e. set K. In §2.4 we studied creative sets and showed that all are computably isomorphic to K. So far the noncomputable c.e. sets we have exhibited are all computably isomorphic to K and therefore of Turing degree 0′. Post in [Post 1944] asked whether there is only one noncomputable c.e. set up to Turing equivalence.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
Author information
Authors and Affiliations
Rights and permissions
Copyright information
© 2016 Springer-Verlag Berlin Heidelberg
About this chapter
Cite this chapter
Soare, R.I. (2016). Classifying C.E. Sets. In: Turing Computability. Theory and Applications of Computability. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-31933-4_5
Download citation
DOI: https://doi.org/10.1007/978-3-642-31933-4_5
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-31932-7
Online ISBN: 978-3-642-31933-4
eBook Packages: Computer ScienceComputer Science (R0)