|
Loading... Introduction to the Theory of Computationby Michael Sipser
LibraryThing recommendationsMember recommendationsLoading...
won't like
will probably not like
will probably like
will like
will love Sign up for LibraryThing to find out whether you'll like this book. This is quite possibly one of the most terse, clearly-written CS theory books that there is. (  ) mlcastle | Apr 8, 2007 |  This was one of the better textbooks I had to use, in terms of aesthetics, design, layout, and materials, but I was always frustrated by its use of animistic metaphor for rigorous algorithmic processes -- a Turing machine no more "wants" or "expects" something than a rock does. At the same time, the examples were usually more illuminating than in other texts, so I can't complain too much. (  ) calebmb | Jun 2, 2006 |  no reviews | add a review
Amazon.com (ISBN 053494728X, Hardcover)"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.(retrieved from Amazon Fri, 24 Apr 2009 07:58:03 -0400) The first test round has been closed. Visit the Open Shelves Classification group for details. |
Abebooks |
||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||
