Call Boomerang Books 1300 36 33 32

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.

Buy Theories of Computability book by Nicholas Pippenger from Australia's Online Independent Bookstore, Boomerang Books.

Book Details

ISBN: 9780521553803
ISBN-10: 0521553806
Format: Hardback
(228mm x 152mm x 19mm)
Pages: 264
Imprint: Cambridge University Press
Publisher: Cambridge University Press
Publish Date: 28-May-1997
Country of Publication: United Kingdom

Other Editions


» Have you read this book? We'd like to know what you think about it - write a review about Theories of Computability book by Nicholas Pippenger and you'll earn 50c in Boomerang Bucks loyalty dollars (you must be a Boomerang Books Account Holder - it's free to sign up and there are great benefits!)

Write Review

Books By Author Nicholas Pippenger

Theories of Computability by Nicholas Pippenger

Theories of Computability

Paperback, June 2010