Theories of Computability

di Nicholas Pippenger (Autore)

Cambridge University Press, 2010

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.

• Autore: Nicholas Pippenger
• Editore: Cambridge University Press
• Anno: 2010
• Rilegatura: Paperback / softback
• Pagine: 264 p.
• Dimensioni: 229 x 152 mm
• Peso: 390 gr.
• EAN: 9780521153430

Testo in English