INTRODUCTION TO THE THEORY OF COMPUTATION 3RD EDITION

Just what I needed to support my Computer Science Masters Degree - clearly laid out, easy to follow and pitched at the right level

Great book to get a broad, yet deep introduction to the theory of computation.

A very well written and easily understandable book. It gets straight to the point and explains everything in detail in a short way. I only give it 4 stars as the material is only somewhat interesting to me.

Clear explanations. Needed as a text for my university course but good material anyway.

Could not put it down. Such a readable and engaging text.

This is a great book for someone with the appropriate background. For example someone in the third year of a mathematics degree might find it a very good read. After some basic reminders about undergraduate-level mathematics the main contents of the book are broken into three parts. The first part is an introduction to finite state automata, regular languages and the like. The second part is on Turing machines and classical recursion theory (the Halting problem and the like) -- so basically a discussion on the notion of how functions can fail to be recursive. Part three is on computational complexity theory, so an introduction to the ideas behind how quickly one can actually compute a computable function. I have a background in mathematics (I am a pure mathematician, a number theorist) and found this part especially interesting and readable.

Avoid avoid avoid

A very good book, which I am using for my Complexity course in college. It is no surprise that it is so highly recommended already. However, it can be a little dry to read at times.

Correspond à mes besoins. Parfait

O livro é excelente em conteúdo porém o formato Kindle contém problemas de formatação

Great print quality, no damage => 5/5.Content => 5/5.Awesome explanations, perfect.

One of the few university books I can actually read

Good price and quality printing with original from publisher.