Computability theory is at the heart of theoretical computer science. Yet, ironically, many of its basic results were discovered by mathematical logicians prior

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

A Concise Introduction to Computation Models and Computability Theory provides an introduction to the essential concepts in computability, using several models

Automata and Computability is a class-tested textbook which provides a comprehensive and accessible introduction to the theory of automata and computation. The

An accessible and rigorous textbook for introducing undergraduates to computer science theory What Can Be Computed? is a uniquely accessible yet rigorous introd