Computability
An Introduction to Recursive Function Theory
- Hardback
- ISBN:9780521223843
- Publication date:June 1980
- 264pages
- Dimensions: 228 x 152 mm
- Weight: 0.54kg
- (C)
View other formats:
This introduction to recursive theory computability begins with a mathematical characterization of computable functions, develops the mathematical theory and includes a full discussion of noncomputability and undecidability. Later chapters move on to more advanced topics such as degrees of unsolvability and Gödel's Incompleteness Theorem.
