- Hardcover: 480 pages
- Publisher: Cengage Learning; 3 edition (June 27, 2012)
- Language: English
- ISBN-10: 113318779X
- ISBN-13: 978-1133187790
- Product Dimensions: 1 x 6.5 x 9.5 inches
- Shipping Weight: 1.7 pounds (View shipping rates and policies)
- Average Customer Review: 97 customer reviews
- Amazon Best Sellers Rank: #22,110 in Books (See Top 100 in Books)
Enter your mobile number or email address below and we'll send you a link to download the free Kindle App. Then you can start reading Kindle books on your smartphone, tablet, or computer - no Kindle device required.
To get the free app, enter your mobile phone number.
Introduction to the Theory of Computation 3rd Edition
Use the Amazon App to scan ISBNs and compare prices.
The Amazon Book Review
Author interviews, book reviews, editors picks, and more. Read it now
Frequently bought together
Customers who bought this item also bought
"The text meets my objectives very well. The author presents the material in an appealing manner, making a hard subject accessible and intuitive to the students. He manages to do that while maintaining the rigor and formalism that the subject warrants. The book has a lot of information packed in it, and can serve as a reference book for students interested in research in theoretical CS."
"As one of my students puts it, the book is 'fun to read and helps him learn the subject better'."
"This is a model for readability, with sensitivity for what students find difficult."
"Excellent prose (simple and succinct) with very good diagrams. It is by far the best presentation of automata in the business."
About the Author
Michael Sipser has taught theoretical computer science and mathematics at the Massachusetts Institute of Technology for the past 32 years. He is a Professor of Applied Mathematics, a member of the Computer Science and Artificial Intelligence Laboratory (CSAIL), and the current head of the mathematics department. He enjoys teaching and pondering the many mysteries of complexity theory.
Top customer reviews
This only dips into the special topics, but introduces many of the important classes, and their relation to other complexity classes. Such classes as L, BPP, IP, Alternating, NC, and of course P, NP, exptime, PSPACE, and more.
It is very well written. It ussually explains the proof ideas before starting, and gives detailed proofs. If you can afford it, this book makes a great intro to complexity theory.
However, this is an intro. This book does not discuss advanced topics in depth, just enough to understand the most common comexity classes and their known relationships.
I found it not much more or less approachable that other introductory texts. Not great for referencing; seemed hard to jump into the right section. Pick it up if recommended by your teacher or if you are self-teaching (much better reference that most on-line).