Abstract
This chapter is intended to give the reader a more intuitive feeling for c.e. sets, their alternative characterizations, and their most useful static and dynamic properties. We also prove the Recursion Theorem 2.2.1 (Fixed Point Theorem), which will be a very useful tool, and we apply it to prove Myhill's Theorem 2.4.6 that all creative sets are computably isomorphic.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
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). Computably Enumerable Sets. In: Turing Computability. Theory and Applications of Computability. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-31933-4_2
Download citation
DOI: https://doi.org/10.1007/978-3-642-31933-4_2
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)