Broad in coverage, mathematically sophisticated, and up to date, this book provides an introduction to theories of computability. It treats not only the theory of computability (the theory created by Alan Turing and others in the 1930s), but also a variety of other theories (of Boolean functions, automata and formal languages) as theories of computability. These are addressed from the classical perspective of their generation by grammars and from...