Description
A mathematically sophisticated introduction to Turing's theory, Boolean functions, automata, and formal languages.
Reviews
"The author is extremely precise and meticulous, giving as much care to a proof that any context-free language can be generated by a grammar in Greibach normal form (GNF) as to a priority argument." Computing Reviews
"...an excellent textbook for a beginning researcher who wants to familiarize himself/herself with several axiomatic frameworks for the theory of computability...I enjoyed the nuggets of wit spread throughout the book, providing a pleasant contrast to the abstract material." SIGACT News
"Aiming readers at the frontier of research, the book has a point to make, and it makes it in an elegant and attractive way." Mathematical Reviews
"The book, which has a list of about 200 references, is well indexed, well organized, and quite well written. But the strongest commendation is for its selection of material and its coherent organization." Siam Review
Book Information
ISBN 9780521553803
Author Nicholas Pippenger
Format Hardback
Page Count 264
Imprint Cambridge University Press
Publisher Cambridge University Press
Weight(grams) 560g
Dimensions(mm) 229mm * 152mm * 19mm