Introduction to the Theory of Computation Hardcover – Dec 1996
Customers Who Bought This Item Also Bought
No Kindle device required. Download one of the Free Kindle apps to start reading Kindle books on your smartphone, tablet, and computer.
To get the free app, enter your e-mail address or mobile phone number.
"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
Ph.D. University of California - Berkeley
What Other Items Do Customers Buy After Viewing This Item?
Top Customer Reviews
This is the first book on computer science theory that I have seen, which is actually written in understandable English. As compared to the previous introductory texts by Hopcroft or Papadimitriou, Sipser shuns writting the entire book using just symbols of formal mathematics. This is not to say that there is no formalism in the book. There is adequate use of formal mathematics in the proofs of the book, but not so much as to scare even in most intrepid readers like in previous books on this subject.The fact I liked most about this book is that every proof in the book is accompanied by a "Proof Idea" which explains using diagrams and plain english how exactly the proof works. This followed by the formal proof. The problems at the end of each chapter are fairly interesting, and some of the * marked problems can be fairly challenging for a first time student.
Another amazing thing about this book is the amount of content it covers. I would have never expected a book of only 400 pages to cover computer science theory all the way from introductory undergraduate to advanced graduate levels. This is because, the author focusses only on core concepts and strives to make them as clear as possible. For example, this book has only one chapter on regular expressions, while every other book that I have seen has at least 3-4 chapters full of gory details.Read more ›
My advice is read this book if you an undergrad student, even though instructor might be using a different book. If you are a grad student this books makes an excellent reference for refreshing your knowledge of Computer Theory. Computer Theory is not my area of interest, but this book makes it very interesting and fun area; which is quiet unusual for Computer Theory books.
I am a grad student taking advanced "Computer Theory" class. I have bought couple books including this one, and checked out from library another 6. This book in an introductory book and it has excellent coverage of the basics, and it has some brief but very good coverage of advanced topics as well. I read this book every time to refresh my knowledge before I go on to more in depth topics. The only thing that I wish, is that the undergrad course that I have taken a number years ago was using this book; and/or I read this book when I was an undergrad.
However, this is the only good book on Theory of Computation for beginners, sadly so. It's just not good enough to earn a 5-star.
I struggled when doing the course with this book because as I was trying to do the questions in the book, I had no references whether I was on the right track or not. And trust me, without the solution book, some instructors don't know how to solve some of the questions either, thus don't expect a student to do it all.
I don't like the idea of holding back the solution book but only instructors have access to it. What good is it if students can't check or learn from the solution.
If you have any other good book on Theory of Computation that has an accompanying solution book, please email me, I'll be much interested because Theory of Computation is what I want to pursue in Grad school.
Proofs on theorems are given virtually always in two steps: first you're presented with the idea that lies behind the proof, and then you get the proof itself in a more rigorous fashion. Again, Sipser strikes here because it's harder NOT to understand one of his proofs than the contrary simply because the presentation is always clear and understandable.
As a matter of fact, Sipser (as he point out in the preface) almost always avoid to overload proofs given by construction with more rigorous following proofs (e.g.Read more ›
Most recent customer reviews
The book was in good condition and arrived a day earlier than the expected day. I was very grateful for this fast delivery since I have homework assignments from this book.Published on Oct. 4 2010 by Mikaela Bell
In my opinion this is one of the best written books in the CS discipline, a must have for every computer scientist. Read morePublished on March 12 2004
This book is suitable for beginners and graduate students who want to explor the theory of computation . It explains the hard theory and logic by easy sentences and words. Read morePublished on Jan. 3 2004 by CHENG-CHUNGLI
This book is one of the best written books on Automata/Theory of Computation that I have ever seen. It is a great introduction to the subject. Read morePublished on Nov. 3 2003 by S C
I was trying to understand quantum computing and i read
this book as a preliminary material on classical computation.
I found it very clear, concise and informative. Read more
I'm confused about how this book got such a good rating. Hmmm. Personally, I think it is the absolute worst book that I have ever read, or should I say "tried" to read. Read morePublished on Feb. 8 2003
I think that this book is by far the best introductory text on theory of computation and complexity that I have read so far. Read morePublished on Jan. 29 2003
Sipser did a surprising and didactical synthesis on classic TC topics. And with wit, too! His work is not a boring opus. Read morePublished on Jan. 27 2003 by Celso Luiz L. Rodrigues
Look for similar items by category
- Books > Computers & Technology > Computer Science > Artificial Intelligence > Machine Learning
- Books > Computers & Technology > Programming > Algorithms
- Books > Professional & Technical > Professional Science > Mathematics > Pure Mathematics
- Books > Science & Math > Mathematics > Pure Mathematics > Discrete Mathematics
- Books > Science & Math > Mathematics > Pure Mathematics > Logic
- Books > Textbooks > Computer Science & Information Systems > Algorithms
- Books > Textbooks > Sciences > Mathematics