1987 | OriginalPaper | Buchkapitel
Type 2 Computability Models
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
In Type 1 recursion theory we have defined computability explicitly on numbers and on words and we have shown that both approaches are essentially equivalent (see Theorem 1.7.5). Computability on other denumerable sets can be reduced to computability on ℕ via numberings or notations. In this chapter we shall introduce three explicit definitions of Type 2 computability and prove that they are essentially equivalent. Any “natural” kind of computability on some other Type 2 set should be reducible to any one of these three definitions by means of a representation.