Theories of Computability [Hardcover]

A mathematically sophisticated introduction to Turing's theory, Boolean functions, automata, and formal languages.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). Particular attention is given to the underlying mathematical structures. Each topic is taken from the beginning and developed to a point at which the most recent results can be appreciated. This authoritative, up-to-date account by one of the leading lights of the subject will be required reading for graduate students researchers in theoretical computer science and mathematics.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). Particular attention is given to the underlying mathematical structures. Each topic is taken from the beginning and developed to a point at which the most recent results can be appreciated. This authoritative, up-to-date account by one of the leading lights of the subject will be required reading for graduate students researchers in theoretical computer science and mathematics.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 the more modern perspective as rational cones. The treatment of lÃN