Power Search
Low Price Guarantee
We Take School POs
Theories of Computability
Contributor(s): Pippenger, Nicholas (Author)

View larger image

 ISBN: 0521153433     ISBN-13: 9780521153430
Publisher: Cambridge University Press
OUR PRICE: $50.34  

Binding Type: Paperback - See All Available Formats & Editions
Published: June 2010
Qty:
Additional Information
BISAC Categories:
- Mathematics | Logic
- Computers | Reference
- Computers | Programming Languages - General
Dewey: 511.3
Physical Information: 0.6" H x 6" W x 9" L (0.86 lbs) 264 pages
 
Descriptions, Reviews, Etc.
Publisher Description:
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.
 
Customer ReviewsSubmit your own review
 
To tell a friend about this book, you must Sign In First!