Qty:1
  • List Price: $100.00
  • Save: $15.16 (15%)
In Stock.
Ships from and sold by Amazon.com.
Gift-wrap available.
+ $3.99 shipping
Used: Like New | Details
Sold by Cherry_Books
Condition: Used: Like New
Comment: US Edition. In Perfect Condition. We do not ship to APO/FPO addresses.
Access codes and supplements are not guaranteed with used items.
Sell yours for a Gift Card
We'll buy it for $48.22
Learn More
Trade in now
Have one to sell? Sell on Amazon
Flip to back Flip to front
Listen Playing... Paused   You're listening to a sample of the Audible audio edition.
Learn more
See all 2 images

The Nature of Computation Hardcover – October 9, 2011

ISBN-13: 978-0199233212 ISBN-10: 0199233217

Buy New
Price: $84.84
16 New from $80.29 14 Used from $80.26
Amazon Price New from Used from
eTextbook
"Please retry"
Hardcover
"Please retry"
$84.84
$80.29 $80.26
Free Two-Day Shipping for College Students with Amazon Student Free%20Two-Day%20Shipping%20for%20College%20Students%20with%20Amazon%20Student


Frequently Bought Together

The Nature of Computation + Computational Complexity: A Modern Approach
Price for both: $137.09

Buy the selected items together
NO_CONTENT_IN_FEATURE
Shop the new tech.book(store)
New! Introducing the tech.book(store), a hub for Software Developers and Architects, Networking Administrators, TPMs, and other technology professionals to find highly-rated and highly-relevant career resources. Shop books on programming and big data, or read this week's blog posts by authors and thought-leaders in the tech industry. > Shop now

Product Details

  • Hardcover: 985 pages
  • Publisher: Oxford University Press (October 9, 2011)
  • Language: English
  • ISBN-10: 0199233217
  • ISBN-13: 978-0199233212
  • Product Dimensions: 9.8 x 2.3 x 7.7 inches
  • Shipping Weight: 5.1 pounds (View shipping rates and policies)
  • Average Customer Review: 4.9 out of 5 stars  See all reviews (9 customer reviews)
  • Amazon Best Sellers Rank: #247,909 in Books (See Top 100 in Books)

Editorial Reviews

Review


"To put it bluntly: this book rocks! It's 900+ pages of awesome. It somehow manages to combine the fun of a popular book with the intellectual heft of a textbook, so much so that I don't know what to call it (but whatever the genre is, there needs to be more of it!)." -- Scott Aaronson, Massachusetts Institute of Technology


"A creative, insightful, and accessible introduction to the theory of computing, written with a keen eye toward the frontiers of the field and a vivid enthusiasm for the subject matter." -- Jon Kleinberg, Cornell University


"If you want to learn about complexity classes, scaling laws in computation, undecidability, randomized algorithms, how to prepare a dinner with Pommard, Quail and Roquefort, or the new ideas that quantum theory brings to computation, this is the right book. It offers a wonderful tour through many facets of computer science. It is precise and gets into details when necessary, but the main thread is always at hand, and entertaining anecdotes help to keep the pace." -- Marc Mézard, Université de Paris Sud, Orsay


"A treasure trove of ideas, concepts and information on algorithms and complexity theory. Serious material presented in the most delightful manner!" -- Vijay Vazirani, Georgia Instituute of Technology


"A fantastic and unique book - a must-have guide to the theory of computation, for physicists and everyone else." -- Riccardo Zecchina, Politecnico di Torino


About the Author


Cristopher Moore graduated from Northwestern University with honors in 1986, at the age of 18, with a B.A. in Mathematics, Physics, and Integrated Science. He received his Ph.D. in Physics from Cornell University at the age of 23. After a postdoc at the Santa Fe Institute, he joined the faculty of the University of New Mexico, where he holds joint appointments in Computer Science and Physics and Astronomy. He has written over 90 papers, on topics ranging from undecidability in dynamical systems, to quantum computing, to phase transitions in NP-complete problems, to the analysis of social and biological networks.

Stephan Mertens got his Diploma in Physics in 1989, and his Ph.D. in Physics in 1991, both from Georg-August University Göttingen. He holds scholarships from the "Studienstiftung des Deutschen Volkes", Germany's most prestigious organisation sponsoring the academically gifted. After his Ph.D. he worked for three years in the software industry before he joined the faculty of Otto-von-Guericke University Magdeburg as a theoretical physicist. His research focuses on disordered systems in statistical mechanics, average case complexity of algorithms, and parallel computing.

More About the Authors

Discover books, learn about writers, read author blogs, and more.

Customer Reviews

4.9 out of 5 stars
5 star
8
4 star
1
3 star
0
2 star
0
1 star
0
See all 9 customer reviews
Share your thoughts with other customers

Most Helpful Customer Reviews

11 of 13 people found the following review helpful By Josep Diaz on January 22, 2012
Format: Hardcover
This is a beautiful encyclopedic book, which covers a large range of topics from Theoretical Computer Science. The style favors intuition and clarity over technical details. Chapters 4 to 8 can be used as a textbook for an undergraduate complexity course. For computer science and mathematics students the book has the great advantage of examples from the physics world... the more advanced material can be easily used for graduate courses or seminars. For example, Chapters 12, 13 and 14 by themselves could be a perfect basic text for an advanced course in probabilistic methods in computer science and discrete mathematics. I hope future readers enjoy the book as much as I did.
(See longer review at Computer Science Reviews 5 (2011) 341.)
1 Comment Was this review helpful to you? Yes No Sending feedback...
Thank you for your feedback. If this review is inappropriate, please let us know.
Sorry, we failed to record your vote. Please try again
7 of 9 people found the following review helpful By M. Villagra on March 22, 2012
Format: Hardcover
There are fantastic books all over theoretical computer science on the same subjects. But this one, I find it simply the best of all of them. Why? Because it explains what really computer science is about, which is computation as the object of study, and it does so in such a friendly manner and accessible to mathematicians, physicists and (of course) computer scientists of all levels. In the preface of the book explicitly says so, the objective of this book is to show why computational complexity is such a beautiful field with beautiful mathematics, without going too much deeper into the technicalities. Even though they omit the gruesome details, I felt that the understanding gained from reading the book was enough to look at the references and go directly to the papers. Thus, at the same time, this book presents a full review of all computational complexity theory. Also, the problems at the end of each chapter are very fun, and they make the reader gain a deeper understanding of the chapter and other subjects that were not covered. The notes section after each problem set are full of anecdotes and historical remarks that makes the reading experience even more wonderful.
Comment Was this review helpful to you? Yes No Sending feedback...
Thank you for your feedback. If this review is inappropriate, please let us know.
Sorry, we failed to record your vote. Please try again
5 of 7 people found the following review helpful By Dan MacKinlay on August 22, 2012
Format: Hardcover Verified Purchase
This book starts with high-school mathematics and takes you all the way through the amazing architecture of mathematical problems themselves. It's encyclopaedia-length, but light and readable in style all the way through, sprinkled with liberal references to Lewis Carroll, Douglas Hofstadter and various other cult favourites of the literate mathnerd. That is, this exemplifies everything good about mathematical texts. Amazing.

For background, I am a mathematics major, but I had almost no exposure to computational complexity theory before starting this book apart from, say, the awareness that matrix inversion is approximately O(n^3)
Comment Was this review helpful to you? Yes No Sending feedback...
Thank you for your feedback. If this review is inappropriate, please let us know.
Sorry, we failed to record your vote. Please try again
Format: Hardcover Verified Purchase
This is a terrific book with a fatal flaw.

First, the flaw: the binding is awful. It broke the very first time I opened the book, and it's broken multiple times since then. I've read it very carefully, never set it on a table upside down, etc etc. The binding is just terrible, and I have no idea why.

Everything else is awesome. The contents are great, and exposition is great, the problems are great, and the notes at the end of each chapter are great. The bibliography is extensive and terrific. Probably the single nicest thing about the book is that the authors' enthusiasm for the subject really shines through.

I have no idea if the kindle version is good or bad; there are enough formulae and diagrams that it might suffer. But if it's good, I would definitely recommend getting that over the print version with its bad binding.
1 Comment Was this review helpful to you? Yes No Sending feedback...
Thank you for your feedback. If this review is inappropriate, please let us know.
Sorry, we failed to record your vote. Please try again
6 of 9 people found the following review helpful By Brian Malley on January 20, 2013
Format: Hardcover Verified Purchase
This book did not prove to be quite what I had expected when I purchased it, but I have greatly enjoyed it anyway. This book is not really about the *nature* of computation, or even about computation at all, but rather about the structure of the problem-space encountered by computational systems. It is about the different kinds of computational problems. I have found it very interesting, and this book is written in such a way that even a newbie with limited mathematics can understand the key ideas. I highly recommend this introduction to anyone interested in natural science or technology.
1 Comment Was this review helpful to you? Yes No Sending feedback...
Thank you for your feedback. If this review is inappropriate, please let us know.
Sorry, we failed to record your vote. Please try again