Theories of Computability
Theories of Computability
AUD$75.41
exc GSTThis 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.
- A summing up of the area by one of its leading lights (the author is the 'N. P.' for whom NP-completeness is named)
- Broad in coverage
- Mathematically sophisticated
Product details
June 2010Paperback
9780521153430
264 pages
229 × 152 × 15 mm
0.39kg
Available
Table of Contents
- 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.
