Computability: a mathematical sketchbook
Choice Reviews Online · 1994
Aimed at mathematicians and computer scientists who will only be exposed to one course in this area, this is a brief but rigorous introduction to the abstract theory of computation, sometimes also referred to as recursion theory. It develops major themes in computability theory, such as Rice's theorem and the recursion theorem, and provides a systematic account of Blum's complexity theory as well as an introduction to the theory of computable real numbers and functions. The book is intended as a university text, but it may also be used for self-study. Appropriate exercises and solutions are included.