or
Sign in to turn on 1-Click ordering.
Trade in Yours
For a 19.50 Gift Card
Trade in
More Buying Choices
Have one to sell? Sell yours here
Sorry, this item is not available in
Image not available for
Colour:
Image not available

 

The Nature of Computation [Hardcover]

Cristopher Moore , Stephan Mertens
5.0 out of 5 stars  See all reviews (2 customer reviews)
RRP: 57.50
Price: 48.88 & FREE Delivery in the UK. Details
You Save: 8.62 (15%)
o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o
Only 6 left in stock (more on the way).
Dispatched from and sold by Amazon. Gift-wrap available.
Want it Tuesday, 22 April? Choose Express delivery at checkout. Details

Formats

Amazon Price New from Used from
Kindle Edition 36.66  
Hardcover 48.88  
Paperback --  
Trade In this Item for up to 19.50
Trade in The Nature of Computation for an Amazon.co.uk gift card of up to 19.50, which you can then spend on millions of items across the site. Trade-in values may vary (terms apply). Learn more

Book Description

Jun 2011 0199233217 978-0199233212
Computational complexity is one of the most beautiful fields of modern mathematics, and it is increasingly relevant to other sciences ranging from physics to biology. But this beauty is often buried underneath layers of unnecessary formalism, and exciting recent results like interactive proofs, phase transitions, and quantum computing are usually considered too advanced for the typical student. This book bridges these gaps by explaining the deep ideas of theoretical computer science in a clear and enjoyable fashion, making them accessible to non-computer scientists and to computer scientists who finally want to appreciate their field from a new point of view. The authors start with a lucid and playful explanation of the P vs. NP problem, explaining why it is so fundamental, and so hard to resolve. They then lead the reader through the complexity of mazes and games; optimization in theory and practice; randomized algorithms, interactive proofs, and pseudorandomness; Markov chains and phase transitions; and the outer reaches of quantum computing. At every turn, they use a minimum of formalism, providing explanations that are both deep and accessible. The book is intended for graduate and undergraduate students, scientists from other areas who have long wanted to understand this subject, and experts who want to fall in love with this field all over again.

Frequently Bought Together

The Nature of Computation + Godel, Escher, Bach: An Eternal Golden Braid (20th anniversary edition with a new preface by the author)
Buy the selected items together


Product details

  • Hardcover: 1032 pages
  • Publisher: OUP Oxford (Jun 2011)
  • Language: English
  • ISBN-10: 0199233217
  • ISBN-13: 978-0199233212
  • Product Dimensions: 24.9 x 19.3 x 5.6 cm
  • Average Customer Review: 5.0 out of 5 stars  See all reviews (2 customer reviews)
  • Amazon Bestsellers Rank: 343,627 in Books (See Top 100 in Books)
  • See Complete Table of Contents

More About the Authors

Discover books, learn about writers, and more.

Product Description

Review

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)

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)

Moore and Mertens guide the reader through the interesting field of computational complexity in a clear, broadly accessible and informal manner, while systematically explaining the main concepts and approaches in this area and the existing links to other disciplines. The book is comprehensive and can be easily used as a textbook, at both advanced undergraduate and postgraduate levels, but is equally useful for researchers in neighbouring disciplines, such as statistical physics [...]. Some of the material covered, such as approximability issues and Probabilistically Checkable Proofs is typically not presented in books of this type, and the authors do an excellent job in presenting them very clearly and convincingly. (David Saad, Aston University, Birmingham)

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)

In a class by itself - in The Nature of Computation, Cristopher Moore and Stephan Mertens have produced one of the most successful attempts to capture the broad scope and intellectual depth of theoretical computer science as it is practiced today. The Nature of Computation is one of those books you can open to a random page and find something amazing, surprising and, often, very funny. (American Scientist)

Inside This Book (Learn More)
Browse Sample Pages
Front Cover | Copyright | Table of Contents | Excerpt | Index
Search inside this book:

What Other Items Do Customers Buy After Viewing This Item?


Customer Reviews

4 star
0
3 star
0
2 star
0
1 star
0
5.0 out of 5 stars
5.0 out of 5 stars
Most Helpful Customer Reviews
5 of 5 people found the following review helpful
5.0 out of 5 stars Great content, beautiful presentation 9 Dec 2012
Format:Kindle Edition|Verified Purchase
REVISED REVIEW

I wrote a review here in late 2012 praising the book's content (which is great) and criticising the layout / typography of the kindle version, which was truly dreadful. That kindle version has now been removed from sale and replaced by a 'print replica' version, which is simply beautiful. I'm now reading the book again, and enjoying it even more.

The only downside is that it can't be viewed on a regular kindle (needs iPad / computer), but that display probably couldn't do it justice anyway.
Was this review helpful to you?
1 of 6 people found the following review helpful
5.0 out of 5 stars Amazing delivery, amazing book 17 Jan 2012
By KDK
Format:Hardcover
This review actually concerns amazon.co.uk shipping rather than the book itself. It was so amazing that I would like to share my experience and appreciation.

I placed my order Friday night; delivery option - standard international. I was emailed on Saturday morning that the book has been shipped by amazon.co.uk. The book was on my desk in Turkey on Tuesday morning. Simply amazing! Well done!

The book itself is also amazing - unusual, deep and delightful. Everyone interested, teaching or working in computation theory, algorithm analysis and design, complexity theory, foundation of mathematics should have it. It provides a common, meaningful insight into all these fields as a whole. However, I only had a quick glimpse and am not ready to write serious enough comments.
Comment | 
Was this review helpful to you?
Most Helpful Customer Reviews on Amazon.com (beta)
Amazon.com: 5.0 out of 5 stars  6 reviews
11 of 13 people found the following review helpful
5.0 out of 5 stars Beautiful encyclopedic book 22 Jan 2012
By Josep Diaz - Published on Amazon.com
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.)
6 of 8 people found the following review helpful
5.0 out of 5 stars Best theory of computation book ever! 23 Mar 2012
By M. Villagra - Published on Amazon.com
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.
6 of 9 people found the following review helpful
5.0 out of 5 stars Fantastic introduction to computational complexity 20 Jan 2013
By Brian Malley - Published on Amazon.com
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.
2 of 3 people found the following review helpful
5.0 out of 5 stars The best book on computational theory 10 Jan 2013
By Parisa - Published on Amazon.com
Format:Hardcover|Verified Purchase
I have read several books on computational theory. The majority of these books make this amazing topic look agonizingly boring and difficult. This book on the other hand, makes you fall in love with the subject. If you want to have an intuitive while profound understanding of the field, this is the book, don't look any further.
3 of 5 people found the following review helpful
5.0 out of 5 stars Headmelting 23 Aug 2012
By Dan MacKinlay - Published on Amazon.com
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)
Were these reviews helpful?   Let us know
Search Customer Reviews
Only search this product's reviews
ARRAY(0xa30ab2b8)

Customer Discussions

This product's forum
Discussion Replies Latest Post
No discussions yet

Ask questions, Share opinions, Gain insight
Start a new discussion
Topic:
First post:
Prompts for sign-in
 

Search Customer Discussions
Search all Amazon discussions
   


Look for similar items by category


Feedback