You are here

Computability: An Introduction to Recursive Function Theory

Publisher: 
Cambridge University Press
Number of Pages: 
264
Price: 
34.99
ISBN: 
0521294657
Date Received: 
Monday, July 17, 2006
Reviewable: 
Yes
Include In BLL Rating: 
Yes
N. J. Cutland
Publication Date: 
1980
Format: 
Paperback
Category: 
Monograph
BLL Committee
10/29/2010
BLL Rating: 

 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.

Publish Book: 
Modify Date: 
Friday, October 29, 2010

Dummy View - NOT TO BE DELETED