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.

Bookmark:

Introduction to the Theory of Computation, Second Edition

By Michael Sipser

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.

Book Details

• ISBN-10: 0534950973
• ISBN-13: 978-0534950972
• Publisher: Course Technology; 2 edition (February 15, 2005)
• 456 pages