How much partiality is needed for a theory of computability?

DOI10.3233/com-230463arXiv2305.06982OpenAlexW4389946807MaRDI QIDQ6146825

Dieter Spreen

Publication date: 31 January 2024

Published in: Computability (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/2305.06982

zbMATH Keywords

computability theoryGödel numberingdomain theorynumbering theoryrecursion theoremisomorphism theoremnon-terminationadmissible numberingRogers semi-lattice

Mathematics Subject Classification ID

Computability and recursion theory (03Dxx)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Computable one-to-one enumerations of effective domains
• Computation of recursive functionals using minimal initial segments
• Admissible representations of effective cpo's
• Theory of representations
• Classical recursion theory. The theory of functions and sets of natural numbers.
• Über die Reduzierbarkeit berechenbarer Numerierungen
• Computable functionals of finite types
• General recursive functions of natural numbers
• Filter spaces and continuous functionals
• Effective operations on partial recursive functions
• Gödel numberings of partial recursive functions
• Konstruktive Darstellungen Reeller Zahlen und Folgen
• Theorie der Numerierungen I
• Berechenbare Reelle Funktionen
• Die Struktur des Halbverbandes der Effektiven Numerierungen
• The Structure of the Lattice of Recursive Sets
• Berechenbare Reelle Funktionenfolgen
• STANDARD CLASSES OF RECURSIVELY ENUMERABLE SETS
• Continuous Lattices and Domains
• Godel Numberings Versus Friedberg Numberings
• Zur Präzisierung des Begriffes Berechenbare Reelle Funktion
• Classes of Recursively Enumerable Sets and Their Decision Problems