Computability : a mathematical sketchbook
Douglas S. Bridges.
New York : Springer-Verlag, ©1994.
ix, 178 págs. : ilustraciones ; 25 cm.
Serie: Graduate texts in mathematics ; 146
ISBN: 0387941746 (New York), 3540941746 (Berlin)
"Solutions to exercises": p. [117]-172.
Incluye referencias bibliográficas (p. [173]-175) e índice.
Reseña: MathSciNet, 94k:03044
Contenido
- 1. What is a Turing machine?
- 2. Computable partial functions
- 3. Effective enumerations
- 4. Computable numbers and functions
- 5. Rice's theorem and the recursion theorem
- 6. Abstract complexity theory.