Computability and complexity theory should be of central concern to practitioners as well as theorists. Unfortunately, however, the field is known for its impen

Turing's famous 1936 paper introduced a formal definition of a computing machine, a Turing machine. This model led to both the development of actual computers a

A mathematically sophisticated introduction to Turing's theory, Boolean functions, automata, and formal languages.

Aimed at mathematicians and computer scientists who will only be exposed to one course in this area, Computability: A Mathematical Sketchbook provides a brief b

This book offers an original and informative view of the development of fundamental concepts of computability theory. The treatment is put into historical conte