A few results on the complexity of classes of identifiable recursive function sets

Reinhard Klette

Displaying similar documents to “A few results on the complexity of classes of identifiable recursive function sets”

Notation systems and recursive ordered fields

Yiannis N. Moschovakis (1965-1966)

Compositio Mathematica

Similarity:

Recursiveness of initial segments of Kleene's O

Carl Jockusch (1975)

Fundamenta Mathematicae

Similarity:

Extension pathology in regressive isols

Matthew J. Hassett (1973)

Compositio Mathematica

Similarity:

Recursive families of sets

S. Mrówka (1957)

Fundamenta Mathematicae

Similarity:

Quantification of number-theoretic functions

S. C. Kleene (1959-1960)

Compositio Mathematica

Similarity:

Good choice sets

J. C. E. Dekker (1966)

Annali della Scuola Normale Superiore di Pisa - Classe di Scienze

Similarity:

Recursive metric spaces

Y. Moschovakis (1964)

Fundamenta Mathematicae

Similarity:

CONTENTS Foreword.......................................................................................... 3 I. Recursive and computable numbers...................................... 4 1. Recursive numbers................................................................... 5 2. Computable numbers............................................................... 17 II. Recursive and computable sequences................................. 22 III. Recursive and computable functionals....................................