Introduction to the Theory of Computation

Front Cover
PWS Publishing Company, 1996 - Computational complexity - 239 pages
1 Review
Discusses such topics as: regular languages; context-free languages; Church-Turing thesis; decidability; reducibility; the recursion theorem; time complexity; space complexity; and provable intractability.

From inside the book

What people are saying - Write a review

Review: Introduction to the Theory of Computation

User Review  - Chris Herdt - Goodreads

This was a surprisingly well-organized and well-written textbook. I consulted some additional texts on the subject during the course I was taking, but this book was superior to any of them. I would ... Read full review


Automata and Languages
ContextFree Languages
Computability Theory

5 other sections not shown

Other editions - View all

Common terms and phrases

About the author (1996)

Michael Sipser has taught theoretical computer science and other mathematical subjects at the Massachusetts Institute of Technology for the past 25 years, where he is a professor of Applied Mathematics and a member of the Computer Science and Artificial Intelligence Laboratory (CSAIL). Currently, he is the head of the mathematics department. He enjoys teaching and pondering the many mysteries of complexity theory.

Bibliographic information