Good choice sets
J. C. E. Dekker (1966)
Annali della Scuola Normale Superiore di Pisa - Classe di Scienze
Similarity:
Displaying similar documents to “Hierarchies of function classes defined by the first-value operator”
Good choice sets
A few results on the complexity of classes of identifiable recursive function sets
Reinhard Klette (1982)
Banach Center Publications
Similarity:
Effective cofinalities and admissibility in E-recursion
E. Griffor, Dag Normann (1984)
Fundamenta Mathematicae
Similarity:
Wadge degrees of -languages of deterministic Turing machines
Victor Selivanov (2003)
RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications
Similarity:
We describe Wadge degrees of -languages recognizable by deterministic Turing machines. In particular, it is shown that the ordinal corresponding to these degrees is where is the first non-recursive ordinal known as the Church–Kleene ordinal. This answers a question raised in [2].
Reducibilities of sets based on constructive functions of a real variable
Osvald Demuth (1988)
Commentationes Mathematicae Universitatis Carolinae
Similarity:
Recursiveness of initial segments of Kleene's O
Carl Jockusch (1975)
Fundamenta Mathematicae
Similarity:
General recursive functionals of finite type and hierarchies of functions
R. O. Gandy (1967)
Annales scientifiques de l'Université de Clermont. Mathématiques
Similarity: