
Computability
This title is an introduction to computability theory covering: non-computability and undecidability; the theory of recursive and recursively enumerable sets; Gildel's incompleteness theorem; degrees of unsolvability; the recursion theorems; and the theory of complexity of computation.
- Alaotsikko
- An Introduction to Recursive Function Theory
- Kirjailija
- Nigel Cutland
- ISBN
- 9780521294652
- Kieli
- englanti
- Paino
- 410 grammaa
- Julkaisupäivä
- 19.6.1980
- Kustantaja
- Cambridge University Press
- Sivumäärä
- 264