Introduction to the Theory of Computation
Summary
The feel-good place to buy books
Introduction to the Theory of Computation by Michael Sipser
Discusses such topics as: regular languages; context-free languages; Church-Turing thesis; decidability; reducibility; the recursion theorem; time complexity; space complexity; and provable intractability.
Sipser, Michael: - 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.
| SKU | Unavailable |
| ISBN 13 | 9780534952501 |
| ISBN 10 | 053495250X |
| Title | Introduction to the Theory of Computation |
| Author | Michael Sipser |
| Condition | Unavailable |
| Binding Type | Paperback |
| Publisher | Pws Pub Co |
| Year published | 1996-01-25 |
| Number of pages | 256 |
| Cover note | Book picture is for illustrative purposes only, actual binding, cover or edition may vary. |
| Note | Unavailable |