TY  - BOOK
AU  - Weber, Rebecca
TI  - Computability theory
SN  - 9781470425944
AV  - QA9.6 
PY  - 2012///]
CY  - Rhode Island
PB  - AMS
KW  - Mathematics
N1  - Chapter 1. Introduction
Chapter 2. Background
Chapter 3. Defining computability
Chapter 4. Working with computable functions
Chapter 5. Computing and enumerating sets
Chapter 6. Turing reduction and Post’s problem
Chapter 7. Two hierarchies of sets
Chapter 8. Further tools and results
Chapter 9. Areas of research

N2  - The goal of this book is to give the reader a firm grounding in the fundamentals of computability theory and an overview of currently active areas of research, such as reverse mathematics and algorithmic randomness. Turing machines and partial recursive functions are explored in detail, and vital tools and concepts including coding, uniformity, and diagonalization are described explicitly. From there the material continues with universal machines, the halting problem, parametrization and the recursion theorem, and thence to computability for sets, enumerability, and Turing reduction and degrees. A few more advanced topics round out the book before the chapter on areas of research. The text is designed to be self-contained, with an entire chapter of preliminary material including relations, recursion, induction, and logical and set notation and operators. That background, along with ample explanation, examples, exercises, and suggestions for further reading, make this book ideal for independent study or courses with few prerequisites.
ER  -