Theories of Computability

Front Cover
Cambridge University Press, May 28, 1997 - Computers - 251 pages
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 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, written by one of the leading lights of the subject, will be required reading for graduate students and researchers in theoretical computer science and mathematics.
 

What people are saying - Write a review

We haven't found any reviews in the usual places.

Contents

Finite Automata and Their Languages
46
Grammars and Their Languages
99
Computable Functions and Relations
141
References
234
Author Index
243
Math Index
250
Copyright

Other editions - View all

Common terms and phrases

Bibliographic information