Order from a Major Online Bookstore
Ultimate Book Price Comparison Engine
Save Your Time And Money
| AnyBook4Less.com | Order from a Major Online Bookstore |
|
| Home | Store List | FAQ | Contact Us | | ||
| Ultimate Book Price Comparison Engine Save Your Time And Money |
||
 |
Title: Introduction to the Theory of Computation by Michael Sipser ISBN: 0-534-94728-X Publisher: Brooks Cole Pub. Date: 13 December, 1996 Format: Hardcover Volumes: 1 List Price(USD): $103.95 |
Average Customer Rating: 4.68 (34 reviews)
Rating: 5
Summary: BEST Computer Theory book
Comment: This book is by far the best book that I read!!! It presents topics in a very interesting and readable way.
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.
Rating: 5
Summary: Great book
Comment: Michael Sipser has an undoubted gift for writing on this subject. The book is a coincise and easy read. But be cautious, this doesn't mean superficial and poor. The book contains all the material needed for a good course on Theory of Computation and Complexity. Perhaps it has not plenty of details like other books as Hopcroft & Ullman or Kozen or Papadimitrou, but don't underestimate the vastity of the treated topics, what is important is that every time you finish a chapter, you have the sensation that you've learned what you should have to. And probably you did due to Sipser's writing style, provided that you can afford to skip "some" more detailed/advanced topics. Or you might just be looking for some further stuff like Myhill-Nerode or Rabin-Shepherdson theorems or Chomsky Hierarchy for example, and you would have to look elsewhere for them. However, I've never been told that the best book is the most complete one. As long as I've learned, the best book is the one that best fits your needs, and that fitting these needs it suceeds to transmit the knowledge you're looking for in an effective way. That's why if this stuff is not required by your course, you would be perfectly fine with this book in your hands.
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. induction on the constructed machine to prove its equivalence with ...). This has a strong impact on the attention you can keep when studying throghout a chapter: avoiding to dive into tedious details when the proof (by construction) has been clear enough help to keep you attention high and boredom away. This is a way of learning, an effective way.
Sipser uses sometime a notation that's different from the somewhat standard one (e.g. the description of delta or transition function on various machines), but it is coherent throughout the whole book, and that's what does count, together with the note that this notation is noway more complex or hard to understand than the "standard" one.
Should I name two books on Theory of Computation (not Complexity), one just a little less rigorous and one just a little more rigorous than this, I would suggest Coehn's "Introduction to computer Theory" and Kozen's "Automata and Computability" respectively.
My conclusion is that this is a great book, worth the price (especially if confronted with others ...) and a stable place in my bookshelf.
Rating: 5
Summary: A Near Perfect Computer Theory Textbook
Comment: 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. Even if you use English as foreign language , you can read this book by yourself and understand its contents easily. This book is near perfect.
 |
Title: Introduction to Algorithms, Second Edition by Thomas H. Cormen, Charles E. Leiserson, Ronald L. Rivest, Clifford Stein ISBN: 0262032937 Publisher: MIT Press Pub. Date: 01 September, 2001 List Price(USD): $79.95 |
 |
Title: Introduction to Automata Theory, Languages, and Computation (2nd Edition) by John E. Hopcroft, Rajeev Motwani, Jeffrey D. Ullman ISBN: 0201441241 Publisher: Pearson Addison Wesley Pub. Date: 14 November, 2000 List Price(USD): $101.00 |
 |
Title: Computational Complexity by Christos H. Papadimitriou ISBN: 0201530821 Publisher: Addison-Wesley Pub Co Pub. Date: 30 November, 1993 List Price(USD): $61.00 |
 |
Title: Computer Organization and Design Second Edition : The Hardware/Software Interface by David Patterson, John Hennessy ISBN: 1558604286 Publisher: Morgan Kaufmann Pub. Date: 01 August, 1997 List Price(USD): $84.95 |
 |
Title: Computers and Intractability: A Guide to the Theory of Np-Completeness (Series of Books in the Mathematical Sciences) by Michael R. Garey, David S. Johnson ISBN: 0716710455 Publisher: W H Freeman & Co. Pub. Date: June, 1979 List Price(USD): $41.26 |
Thank you for visiting www.AnyBook4Less.com and enjoy your savings!
Copyright� 2001-2021 Send your comments
