The book provides a self-contained introduction to computability theory for advanced undergraduate or early graduate students of mathematics and computer scienc

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 a self-contained exposition of the theory of computability in a higher-order context, where 'computable operations' may themselves be passed as

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

This introductory text covers the key areas of computer science, including recursive function theory, formal languages, and automata. Additions to the second ed