Open Daily: 10am - 10pm | Alley door pickup 10am - 7pm 3038 Hennepin Ave Minneapolis, MN
612-822-4611

  • Open Daily: 10am - 10pm
    Alley-side Pickup: 10am - 7pm

    3038 Hennepin Ave Minneapolis, MN
    612-822-4611

Open Daily: 10am - 10pm | Alley-side Pickup: 10am - 7pm
3038 Hennepin Ave Minneapolis, MN
612-822-4611
Theories of Computability

Theories of Computability

Pippenger, Nicholas

Hardcover

FictionGeneral ComputersProgramming

ISBN10: 0521553806
ISBN13: 9780521553803
Publisher: Cambridge
Published: May 28 1997
Pages: 264
Weight: 1.15
Height: 0.80 Width: 6.10 Depth: 9.10
Language: English
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.

1 different editions

Also available

Also in

Fiction

View All