2016 | OriginalPaper | Buchkapitel
Computably Enumerable Sets
verfasst von : Robert I. Soare
Erschienen in: Turing Computability
Verlag: Springer Berlin Heidelberg
Aktivieren Sie unsere intelligente Suche, um passende Fachinhalte oder Patente zu finden.
Wählen Sie Textabschnitte aus um mit Künstlicher Intelligenz passenden Patente zu finden. powered by
Markieren Sie Textabschnitte, um KI-gestützt weitere passende Inhalte zu finden. powered by
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.