Computability

Aimed at mathematicians and computer scientists who will only be exposed to one course in this area, Computability: A Mathematical Sketchbook provides 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.

Computability: A Mathematical Sketchbook is a concise, rigorous introduction to the theory of computation. Using Turing machines as models of computers, the author develops major themes of computability theory, culminating in a systematic account of Blum's abstract complexity measures. One of the book's unique aspects is the inclusion of a chapter on computable real numbers and elementary computable analysis. Exercises and solutions form an integral part of the material. The book is suitable for self-study and provides excellent course materials for senior and graduate-level students in mathematics and computer science.