Discusses such topics as: regular languages; context-free languages; Church-Turing thesis; decidability; reducibility; the recursion theorem; time complexity; space complexity; and provable intractability.
Read More
Discusses such topics as: regular languages; context-free languages; Church-Turing thesis; decidability; reducibility; the recursion theorem; time complexity; space complexity; and provable intractability.
Read Less
Add this copy of Introduction to the Theory of Computation (Pws Series to cart. $17.79, very good condition, Sold by HPB-Diamond rated 4.0 out of 5 stars, ships from Dallas, TX, UNITED STATES, published 1996 by Pws Pub Co.
Choose your shipping method in Checkout. Costs may vary based on destination.
Seller's Description:
Very good. Connecting readers with great books since 1972! Used books may not include companion materials, and may have some shelf wear or limited writing. We ship orders daily and Customer Service is our top priority!
Add this copy of Introduction to the Theory of Computation (Pws Series to cart. $51.47, good condition, Sold by Bonita rated 4.0 out of 5 stars, ships from Newport Coast, CA, UNITED STATES, published 1996 by Pws Pub Co.
This is a very complete book about computation mainly for graduate students. As I have used it for an undergraduate course, some logical steps weren't clear to me. There is a "proof idea" before every proof and it is very good because it explains you the ideas behind. The problem is that many proofs themselves are left just as summary, because many important details of proofs are missing. I had to look something on Papadimitriou's book. Some exercises are quite hard and there is the risk to lose too much time on an exercise trying to solve it. The lack of some paragraph about quantum computing is the last defect of this book.
