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
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.
