Rating: 
Summary: Excellent Computability Theory Text
Review: A couple of years ago I simultaneously taught two Computability Theory courses. One was at the graduate level and used this book while the undergraduate course used another text. As I was a visitor, I did not have a role in selecting either text. As the two courses progressed I began to wonder why the graduate text was so much better than the undergraduate text. Later, I checked out an Amazon review for the undergraduate text and discovered that the reviewer was as disgusted with it as I was with the book selected for the undergraduate course. Further, the reviewer specifically recommended this book. This text really is geared for the advanced undergraduate or graduate student. However, it is beautifully thought out and written. Consequently, it is a far better undergraduate introductory text than several of the books which pretend to service this market.
Rating:
Summary: Never have I read such a clear and easy to read textbook!
Review: As a computer-engineering graduate, I've seen some of the definitions and theorems presented in this book. Just now - I really understand them fully! The author really REALLY did a great job in clear, simple explenations. What I liked most is the way the author presents his view on how problems should be approached, when to use this strategy and the useful examples - which really are explained step by step.
I didn't see anything "left to the reader" - so the examples really help out in understanding the fine details. Sipser uses clear, short proofs to theorems - which makes them easy to understand and to remember, and I might even say intuitive. Never have I studied a subject so fast, and so thoroughly as I did using Sipser's book.
Rating:
Summary: The BEST book on computational complexity!
Review: Compare with the bible of this field, "Computational Complexity" by Christos H. Padadimitrious, this book is much more readable and clear! Especially, the author uses the "big picture" approach to present the proofs such that everyone can enjoy reading and studying it. If you want to learn about computational complexity, I strongly recommend this book! The only drawbacks to this book are (1)too expensive (2)too many errata.
Rating: 
Summary: A very good book for beginners on Theory of Computation
Review: Every Computer Science who wants to do Theory of Computation should have this book. Theory of Computation is not that easy to grasp at first, but after a while you'll like it. However, this book doesn't have a solution companion book, which is very frustrating because no one should expect a senior student to know the right answer to some of the questions in the book as the solutions are tricky sometimes. 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.
Rating:
Summary: Theory for the Rest of Us
Review: Finally, a clearly-written, concise, and thorough introduction to the essentials of the theory of computation. Beautifully designed, written, and illustrated, this book fills a long-standing need, acutely felt by students forced to use dense reference books (like Hopcroft and Ullman) in order to learn the material. Focusing on essential areas (regular and context-free languages, the Church-Turing Thesis, NP-Complete problems) and dropping deadwood (context-sensitive languages, index languages), this book efficiently guides readers through the material that they need to know, without getting bogged down in irrelevant details. The "Proof Idea" concept is especially refreshing, helping students focus on the meat of a proof, rather than the irrelevant details. I highly recommend this book to teachers, students, and anyone else interested getting a fundamental background in the theory of computation.
Rating:
Summary: a lifesaver for all computer science majors!
Review: I bought this book in a desperate attempt to pass a Theory of Computation course in which I was enrolled. I was stuck in the sad situation of having a non-English speaking, difficult to understand professor. In addition, the required text for the course was awful. Thanks to Sipser's book, I not only avoided dropping the course, but managed to get an A. (I'm not exagerating). Sipser's book is fantastic compared to others on the subject. It is written in easy to understand, plain, no-nonsense language. (Even the section on pumping lemma is understandable) I became aware of Sipser's book as a result of reading a customer's negative review of another (more expensive) book (Intro to Languages & theory of Computation by J. Martin) on the same subject. The reviewer suggested buying this book by Sipser instead, and that advice was excellent. (Many thanks to that reader, whoever you are!) If you are considering heading for the drop course line at the registrar's office, try this book before you give up and quit!
Rating: 
Summary: Worst book I have ever read
Review: I don't know who was paying the other people to write those reviews. This book is TERRIBLE. The words "clear" and "concise" are the last words I would use to describe this waste of paper. The logic is twisted, convoluted, and ambiguous. The examples are insufficient. There are no redeemable qualities about this book...
Rating:
Summary: The best!
Review: I had this book in a computer theory course and I looked up similar books in the library looking for extra help and different perspectives. They were all horrible in comparison! No book can make this topic as easy as something hands-on like programming, but this one does the best I can imagine. The proofs are preceded by a "proof idea" that outlines what's going on before you get into the rigorous details. The writing is fluid and discusses the implications of the theorems and why they're important. This gives the reader an appreciation of the topic, which is a rare thing in something this arcane. Even if your course doesn't use this book, I recommend buying it as a supplement. I expect it to become a classic in the field.
Rating:
Summary: An Excellent Text
Review: I have (comparatively) minimal background in math and only as much programming/compsci as I've managed to teach myself, and yet this book was very approachable and digestable. Sipser has managed to couch even the more difficult material in ways meaningful to non-academics. All you really need is what some books refer to as "Mathematical maturity", ie. you can think symbolically and are more intrigued by new mathematical/logical concepts than you are intimidated. For budding CompSci majors or programmers, I highly recommend this book as an introduction to the theoretical topics involved in Computer Science.
Rating:
Summary: The material is exposed very clearly
Review: i haven't seen a book on computation theory as clear and easy as this one, it is full of illustrative examples, and PROOF IDEAS..The material is exposed so clearly, that you can read a great amount of material without stopping.. Thanks Michael Sipser for this great book..
| 
