Published by Academic Press (Elsevier Science), December 2010
Here is the
Elsevier page for the book.
And here is the
Amazon page for the book.
Table of Contents
Foreword
Preface
Chapter 1: The Computability Concept
Chapter 2: General Recursive Functions
Chapter 3: Programs and Machines
Chapter 4: Recursive Enumerability
Chapter 5: Connections to Logic
Chapter 6: Degrees of Unsolvability
Chapter 7: Polynomial-Time Computability
Appendix: Mathspeak
Appendix: Countability
Appendix: Decadic Notation
References
Index
Description: This is a textbook for undergraduate mathematics and computer science students, to introduce them to computability theory (recursion theory). It is designed to be accessible to junior and senior students without a previous background in the subject. The book will prepare the students for further study in computational complexity, logic, theoretical computer science, and other topics.