Computably Enumerable Sets
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.
KeywordsComputable Function Winning Strategy Acceptable Numbering Recursion Theorem Partial Computable Function
Unable to display preview. Download preview PDF.