
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.
- Undertitel
- An Introduction to Recursive Function Theory
- Författare
- Nigel Cutland
- ISBN
- 9780521294652
- Språk
- Engelska
- Vikt
- 410 gram
- Utgivningsdatum
- 1980-06-19
- Sidor
- 264