Introduction to the Theory of Computation. Michael Sipser - Softcover

Sipser, Michael

  • 4.24 out of 5 stars
    2,102 ratings by Goodreads
 
9781133187813: Introduction to the Theory of Computation. Michael Sipser

Synopsis

Clearly present even the most complex computational theory topics to your students using Sipser's textbook. This updated edition continues Sipser's approachable style with timely revisions, additional exercises, and more memorable examples in key areas.

"synopsis" may belong to another edition of this title.

About the Author

Michael Sipser has taught theoretical computer science and mathematics at the Massachusetts Institute of Technology for the past 32 years. He is a Professor of Applied Mathematics, a member of the Computer Science and Artificial Intelligence Laboratory (CSAIL), and the current head of the mathematics department. He enjoys teaching and pondering the many mysteries of complexity theory.

Review

Introduction. PART 1: AUTOMATA AND LANGUAGES. 1. Regular Languages. 2. Context-Free Languages. PART 2: COMPUTABILITY THEORY. 3. The Church-Turing Thesis. 4. Decidability. 5. Reducibility. 6. Advanced Topics in Computability Theory. PART 3: COMPLEXITY THEORY. 7. Time Complexity. 8. Space Complexity. 9. Intractability. 10. Advanced Topics in Complexity Theory. Selected Bibliography.

"About this title" may belong to another edition of this title.

Other Popular Editions of the Same Title