Introduction to the Theory of Computationby Michael Sipser Published 01 Feb 2005
|Introduction to the Theory of Computation.pdf|
Download Introduction to the Theory of Computation (2014) PDF ePub eBook
- 1. Register a free 1 month Trial Account.
- 2. Download as many books as you like.
- 3. Cancel the membership at any time if not satisfied.
This highly anticipated revision builds upon the strengths of the previous edition. Sipser's candid, crystal-clear style allows students at every level to understand and enjoy this field. His innovative "proof idea" sections explain profound concepts in plain English. The new edition incorporates many improvements students and professors have suggested over the years, and offers updated, classroom-tested problem sets at the end of each chapter.
"Introduction to the Theory of Computation" Reviews
The best textbook I've read on any subject—by some margin. I'd get carried away reading it, despite the fact that theoretical CS (especially complexity) has never been my thing. It's incredibly accessible, to a surprising degree for a book covering advanced abstract topics.
Sipser writes clearly and explains concepts well but, crucially, he does an incredible job building up your intuition. You don't just learn the material, you understand it. That's something few authors try and fewer yet deliver.
The most visible component of this is the book's structure with "proof sketches"—little proof roadmaps—laid out before diving into the fiddly details of the full proof. All too often, proofs jump around in surprising ways—sure, approach X works, but where did it come from? What insight is it based on? Proof sketches, coupled with quality prose, help you understand where proofs come from and why they make sense, not just how they work.
He also introduces some interesting context to the ideas and formalisms presented. His observation on the "robustness" of Turing-completeness—how virtually any reasonable model of computation, however weird and exotic, seems to have the same level of power—still influences my views on math and CS. Robust properties, emerging almost on their own, make mathematical ideas seem far less arbitrary than they would otherwise. Perhaps it's given me a bad case of platonism.
So: accessible, well-written, enjoyable. Rare qualities for a textbook, making it the perfect place to start with theoretical CS. One caveat comes to mind: it is not very thorough. You get a strong introduction to the field, but nothing more. This gets you going, introduces basic vocabulary and demonstrates the theoretical CS mindset but is not enough to progress further on the subject. A perfect fit if you're reading for enlightenment or curiosity, but needs supplemental resources to go beyond that.
But that's not a real shortcoming, it's just a matter of focus. So, keeping that in mind, I can recommend this book unreservedly for anyone interested in theoretical CS.
For some reason it feels strange to me to write a review for a textbook here at Goodreads, especially for a textbook I read and used years ago. But I love this book.
While I was a college professor (in Computer Science), I received a review copy of this book. I used it several times for miscellaneous reasons, and then one semester I actually got to teach from it. Sipser's writing is very clear and instructional. (It's nowhere near as dry as the once-traditional textbook, Introduction to Automata Theory, Languages, and Computation. Has this been unseated since I changed careers?) His selection of exercises and exercises exceeds my disgustingly high standards.
You can't do better than this book for a college course in computation. I'm not sure how well it would work to read on your own, but it'll still be better than any of the others.
Runs out of depth really early, but I learned my basics of automata theory from this lovely little hardback and will always love it for that. Remains the clearest exposition of the fundamental formalisms of which I'm aware. There's plenty of books with much more meat, and you'll inevitably need them -- browse my library for examples.
The name of the book is confusing - "Introduction to the..." is in fact written as if you already understand the material. Topics are very condensed, where rather than giving space to explain things it tends to say "it is obvious that ...", when often it isn't that obvious.
One of the most interactive book I have ever read. This book explains concept in a very good manner. However this book lacks automata type examples , but theory is sufficient to solve any question from other book.
I like how the book is divided into three sections: Automata and Languages, Computability Theory and Complexity Theory. The book provides a good introduction to computability and complexity maintaining the balance between the two topics. I also like the proof idea sections, which provide valuable insights into proofs before actually proving it formally. Advanced topics in computability and complexity made an interesting read. Obviously one cannot get to the depth of all the theorems on first read as Theory of Computation is quite a dense subject. As the author mentions some of the theorems which are otherwise covered as main text in other books are covered as a part of problems, also some times the text refers to problems from the previous chapters because of which some gaps were left since I didn't plan to go through the problems on my first read.So, the best thing to do is to workout the problems after finishing each chapter.
I think this is a great text on the subject of theory of computation and one who like the subject should definitely read it twice :)