Computably Enumerable Sets

  • Robert I. Soare
Part of the Theory and Applications of Computability book series (THEOAPPLCOM)


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.


Computable Function Winning Strategy Acceptable Numbering Recursion Theorem Partial Computable Function 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer-Verlag Berlin Heidelberg 2016

Authors and Affiliations

  • Robert I. Soare
    • 1
  1. 1.Department of MathematicsThe University of ChicagoChicagoUSA

Personalised recommendations