1987 | OriginalPaper | Buchkapitel
Type 1 Computability Type 2 Computability
verfasst von : Prof. Dr. Klaus Weihrauch
Erschienen in: Computability
Verlag: Springer Berlin Heidelberg
Enthalten in: Professional Book Archive
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
For any representation δ there is a derived numbering vδ, defined by νδ(i):=δφi, of the δ-computable elements. In this chapter the relation between δ-computability and νδ-computability is investigated. It is easy to show that the restriction of a (δ,δ,)-computable function to the computable elements is (νδ,νδ’)-computable. The converse does not seem to be true in general. Only for two special cases a positive answer is known: for “effective” metric spaces (special cases have been proved independently by Ceitin, by Kreisel, Lacombe, and Shoenfield, and by Moschovakis) and for “computable” cpo’s (a special case has been proved by Myhill and Sheperdson). As a corollary we obtain a theorem which characterizes the νδ-r.e. subsets of the δ-computable elements for “computable” cpo’s (Rice /Shapiro theorem). The proofs of the main theorems are rather sophisticated.