You are here

Computability: An Introduction to Recursive Function Theory

N. J. Cutland
Publisher: 
Cambridge University Press
Publication Date: 
1980
Number of Pages: 
264
Format: 
Paperback
Price: 
34.99
ISBN: 
0521294657
Category: 
Monograph
BLL Rating: 

The Basic Library List Committee suggests that undergraduate mathematics libraries consider this book for acquisition.

There is no review yet. Please check back later.

 Preface; Prologue, prerequisites and notation; 1. Computable functions; 2. Generating computable functions; 3. Other approaches to computability: Church's thesis; 4. Numbering computable functions; 5. Universal programs; 6. Decidability, undecidability and partical decidability; 7. Recursive and recursively enumerable sets; 8. Arithmetic and Gödel's incompleteness theorem; 9. Reducibility and degrees; 10. Effective operations on partial functions; 11. The second recursion theorem; 12. Complexity of computation; 13. Further study.

Dummy View - NOT TO BE DELETED