Cargando…
Handbook of computability theory /
The chapters of this volume all have their own level of presentation. The topics have been chosen based on the active research interest associated with them. Since the interest in some topics is older than that in others, some presentations contain fundamental definitions and basic results while oth...
| Clasificación: | Libro Electrónico |
|---|---|
| Otros Autores: | |
| Formato: | Electrónico eBook |
| Idioma: | Inglés |
| Publicado: |
Amsterdam ; New York :
Elsevier,
1999.
|
| Edición: | 1st ed. |
| Colección: | Studies in logic and the foundations of mathematics ;
v. 140. |
| Temas: | |
| Acceso en línea: | Texto completo Texto completo Texto completo |
Tabla de Contenidos:
- Part 1: Fundamentals of Computability Theory.
- Part 2: Reducibilities and Degrees.
- Part 3: Generalized Computability Theory.
- Part 4: Mathematics and Computability Theory.
- Part 5: Logic and Computability Theory.
- Part 6: Computer Science and Computability Theory.
- The history and concpt of computability / R.I. Soare
- Recursively bounded (r.b.) classes in recursion theory / D. Cenzer
- Reducibilities / P. Odifreddi
- Local degree theory / S.B. Cooper
- The global structure of the Turing degrees / T.A. Slaman
- The recursively enumerable degrees / R.A. Shore
- An overview of the computably enumerable sets / R.I. Soare
- The continuous functionals / D. Normann
- Ordinal recursion theory / C.T. Chong and S.D. Friedman
- E-recursion / G.E. Sacks
- Recursion on abstract structures / P.G. Hinman
- Computable rings and fields / V. Stoltenberg-Hansen and J.V. Tucker
- The structure of computability in analysis and physical theory : an extension of Church's thesis / M.B. Pour-El
- Theory of numberings / Y.L. Ershov
- Pure recursive model theory / T.S. Millar
- Classifying recursive functions / H. Schwichtenberg
- Computation models and function algebras / P. Clote
- Polynomial time reducibilities and degrees / K. Ambos-Spies.