- Hardcover: 396 pages
- Publisher: PWS Pub. Co.; 1 edition (December 13, 1996)
- Language: English
- ISBN-10: 053494728X
- ISBN-13: 978-0534947286
- Product Dimensions: 6.8 x 1 x 9.8 inches
- Shipping Weight: 1.6 pounds
- Average Customer Review: 51 customer reviews
- Amazon Best Sellers Rank: #570,271 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 1st Edition
Use the Amazon App to scan ISBNs and compare prices.
Fulfillment by Amazon (FBA) is a service we offer sellers that lets them store their products in Amazon's fulfillment centers, and we directly pack, ship, and provide customer service for these products. Something we hope you'll especially enjoy: FBA items qualify for FREE Shipping and Amazon Prime.
If you're a seller, Fulfillment by Amazon can help you increase your sales. We invite you to learn more about Fulfillment by Amazon .
Frequently bought together
Customers who bought this item also bought
Customers who viewed this item also viewed
"Intended as an upper-level undergraduate or introductory graduate text in computer science theory," this book lucidly covers the key concepts and theorems of the theory of computation. The presentation is remarkably clear; for example, the "proof idea," which offers the reader an intuitive feel for how the proof was constructed, accompanies many of the theorems and a proof. Introduction to the Theory of Computation covers the usual topics for this type of text plus it features a solid section on complexity theory--including an entire chapter on space complexity. The final chapter introduces more advanced topics, such as the discussion of complexity classes associated with probabilistic algorithms.
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
There was a problem filtering reviews right now. Please try again later.
One of the greatest things about this book is its focus on developing an intuitive understanding of the concepts and proofs. Other books do a better job of formal proofs but this book is light years ahead of any other in terms of helping you develop an intuitive understanding of why a given proof or construction is correct. It's a lot better than the memorize/regurgitate model necessitated by the emphasis on minutiae of other books.
Lastly, this book provides great tips on how to approach problem solving (especially proofs).
If you truly wish to understand computation at the axiomatic level, Sipser is undoubtedly the first book you should be picking up.
This is a great supplement, though it would be confusing on its own.
The problems are great and you can find answers to a good chunk of them to see if you're doing it right.
Most recent customer reviews
This book is awesome.
Sipser is a genius and Theory of Computation is an amazing subject with proofs built...Read more
I've spent the entire semester frustrated with this book. To give you an idea of my background, I'm a computer science student with a focus in...Read more