Introduction To The Theory Of Computation
A**R
First Thoughts: Very Mathematical; A Deep Treatment Of This Subject; Up To Date Too
This is a book I would recommend to third year university computer science and third year university pure mathematics students. Rather terse in style densely packed with challenging content, I really will have to take time to read it carefully to fully appreciate it.In my Bachelor of Science at the University of Melbourne years ago I studied some related content in a subject entitled 618-341 Mathematical Logic, and did not take the computer science subject 622-301 Theory Of Computation. Now, from the mathematician's point of view finitism is irrelevant it's a matter of axiom systems being consistent and proving things. The Godel number encoding of theorems and interiority arguments and clever free variable substitution arguments together with model theory were used to establish as true many powerful results ...I note that the terminology has changed since 1982; what was called then 'a recursive formula' is now called Turing decidable and what was called then 'a recursively enumerable formula' is now called 'Turing recognizable'. For example, this author would regard a Turing machine that took a blank tape and churned out the binary representation of pi 3.14159265358979323846 etc in some tape representation to an infinite number of places as a Turing machine that loops, even if such a Turing machine was reasonably well behaved in terms of its generally moving forwards ... This begs the question of real number representation; the bit string 0.11111111111 ... is essentially the same real value as 1.0000000000 ... This suggests to me that Turing theory has taken a more finitistic turn; whether this is to avoid paradoxes recently found I haven't worked out yet. In the real world with its quantum mechanics randomness and lack of apparent finititude it's quite concievable that a multi-tape Turing machine (as described in outline in section 3.2 p176ff) device could resolve a real number function evaluation so as to avoid a value ending in an infinite series of 1's that rightly should be rounded up, and store the real value as a constant in some 'set' device for storing real numbers ... However till we know more about the real truths underlying physics this is mere speculation ...There are a lot of topics that are quite new to me. For example, P less than NP less than PSPACE less than NPSPACE less then EXPTIME seems a rather more complex hypothesis regarding algorithms and their expected time to complete than I've met in other works ... Reading this section I hope will prove rewarding ...Overall it seems that the field has moved on since 1982 in many a way and I hope this book enables me to refresh my knowledge with the latest results. An excellent treatment of the whole field of theory of computation.The only criticism I can think to make is that this work seems to have a finitistic philosophy rather than a mathematical Platonist philosophy ... but then this is essential to the computer science approach rather than a pure mathematical one ...
J**A
This is a great intro to complexity theory
This is a great intro to complexity theory, though expensive for my tastes. I bought it for an autonama class, never read it during the class, but came back to it for the special topics.This only dips into the special topics, but introduces many of the important classes, and their relation to other complexity classes. Such classes as L, BPP, IP, Alternating, NC, and of course P, NP, exptime, PSPACE, and more.It is very well written. It ussually explains the proof ideas before starting, and gives detailed proofs. If you can afford it, this book makes a great intro to complexity theory.However, this is an intro. This book does not discuss advanced topics in depth, just enough to understand the most common comexity classes and their known relationships.
A**7
content great, book in great condition, BUT
errata not corrected, even the print number shows the book was recently printed.What is the point to repeat the same error? are we not expect the publisher to correct the errata in every new print of the book anymore?
W**L
Amazing Book
One of the best books ever written on the theory of computation. I started seeking different theory of computation books when taking a theory of computation class last semester since I found the other text that we were using so confusing that I felt compelled to seek further explanation elsewhere. I found the previous edition of this book in my school's library and was stunned at how thoroughly this book explained the topics which were confusing me in the required class text. After the semester was over I knew I needed to have this book for my collection. I sold back the text I bought for class and bought this new edition. I am absolutely thrilled with the purchase.The material in this book is extremely dense, but all of the topics covered are extremely well covered. I highly suggest purchasing this book if you are interested in the material or are taking a theory of computation class, even if the suggested text is a different book.
B**R
Excellent for industry practitioners as well as students
This is a very practical book as well as theoretical. The exercises are great and help reinforce the material.I used this on the job to learn parser theory. It helped me implement an ANTLR parser for SQL. There is nothing more practical than a good theory.The writing is crisp, clear, and the theory easy to follow because of the book's excellent use of examples and diagrams.I highly recommend this book, not just to students taking a course, but for practitioners working in industry.It was expensive, but well worth the price.
A**M
THIS IS THE INTERNATIONAL EDITION
I got this book thinking I got a great deal on a hard copy of a required text for my class. There's a pdf of this book online- just google it, it's the first result. I would not have bought this book if I knew it was the INTERNATIONAL EDITION. I was given 2 weeks to do an assignment, and I did it pretty slowly because the problems were easy. Well, turns out I was doing the wrong problems. Now it's due in two days, and with an exam that night, I DO NOT have time to start over.I looked at the listing- it mentions at the VERY BOTTOM of the product description that it is the international edition. I didn't read the entire description because...Why would I? I read the first few lines to confirm it was the right book, and ordered. I am very upset.On the bright side, it is a pretty decent book. But not a good enough book to get back a star.
I**.
This book saved my life
But only because the course that used it was actively threatening it. If you want to learn computational theory, this is a great textbook. Some pages requires quite a bit of time to fight through, but that's the nature of the topic. This is also a different edition than you are probably looking for that, according to the cover and copyright information, seems to be utterly illegal to sell in the US. Yet Amazon passes blame.
T**
Theory of computation
O livro é excelente em conteúdo porém o formato Kindle contém problemas de formatação
N**C
Great print quality, no damage.
Great print quality, no damage => 5/5.Content => 5/5.Awesome explanations, perfect.
M**A
Great book
One of the few university books I can actually read
J**A
Book at good price
Good price and quality printing with original from publisher.
J**E
Encuadernación mejorable
Redacción, contenido e ilustraciones 10/10Calidad cobertura y hoja 8/10Encuadernación 6/10
Trustpilot
2 months ago
2 months ago