Theories of Computability

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

Nicholas Pippenger (Author)

9780521153430, Cambridge University Press

Paperback, published 10 June 2010

264 pages
22.9 x 15.2 x 1.5 cm, 0.39 kg

"The book, which has a list of about 200 references, is well indexed, well organized, and quite well written. But the strongest commendation is for its selection of material and its coherent organization." Siam Review

This book gives an introduction to theories of computability from a mathematically sophisticated point of view. It treats not only 'the' theory of computability (created by Alan Turing and others in the 1930s), but also a variety of other theories (of Boolean functions, automata and formal languages). These are addressed from the classical perspective of their generation by grammars and from the modern perspective as rational cones. The treatment of the classical theory of computable functions and relations takes the form of a tour through basic recursive function theory, starting with an axiomatic foundation and developing the essential methods in order to survey the most memorable results of the field. This authoritative account by one of the leading lights of the subject will prove exceptionally useful reading for graduate students, and researchers in theoretical computer science and mathematics.

Preface
1. Finite functions and relations
2. Finite automata and their languages
3. Grammars and their languages
4. Computable functions and relations
References
Author index
Subject index
Math index.

Subject Areas: Mathematical theory of computation [UYA], Mathematical logic [PBCD]