Introduction to the Theory of Computation (repost)
Introduction to the Theory of Computation By Michael Sipser
Publisher: P.W.S Pub 1997 | 396 Pages | ISBN: 053494728X | DJVU | 4 MB
Publisher: P.W.S Pub 1997 | 396 Pages | ISBN: 053494728X | DJVU | 4 MB
"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.