Title: Computability
First published: 1994
Description: 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.
Subjects: Computable functions
LC classification: QA9.59 .B75 1994