The Nature of Computation

4,5 valoración promedio
( 48 valoraciones por Goodreads )
 
9780199233212: The Nature of Computation

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, cryptography, and quantum computing are usually considered too "advanced" to show to the typical student. The aim of this book is to bridge both 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 understand what their formalisms are actually telling.

This book gives a lucid and playful explanation of the field, starting with P and NP-completeness. The authors explain why the P vs. NP problem is so fundamental, and why it is 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 graduates and undergraduates, 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.

To request a copy of the Solutions Manual, visit: http://global.oup.com/uk/academic/physics/admin/solutions

"Sinopsis" puede pertenecer a otra edición de este libro.

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.

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


"The Nature of Computation (TNoC) is a comprehensive, accessible, and highly enjoyable book that conveys the key intellectual contributions of the theory of computing. The project took off as an effort to present theoretical computer science to physicists, but it is equally suitable for any science graduate who is curious to explore beautiful and deep ideas related to the mathematical structure of problems. ... TNoC provides not just a window through which people from other disciplines can get glimpses of the interesting nuggets from computer science, but also provides an entertaining open house session where a visitor can meet various deep ideas and understand the core arguments behind key results." --Haris Aziz, SIGACT News Book Review Column


"The book is highly recommended for all interested readers: in or out of courses, students undergraduate, researchers in other fields eager to learn the subject, or scholars already in the field who wish to enrich their current understanding. It makes for a great textbook in a conventional theory of computing course, as I can testify from recent personal experience (I used it once; I'll use it again!). With its broad and deep wealth of information, it would be a top contender for one of my "desert island" books. [The Nature of Computation] speaks directly, clearly, convincingly, and entertainingly, but also goes much further: it inspires." --Frederic Green, SIGACT News Book Review Column


"Sobre este título" puede pertenecer a otra edición de este libro.

Comprar nuevo Ver libro

Gastos de envío: EUR 3,35
De Reino Unido a Estados Unidos de America

Destinos, gastos y plazos de envío

Añadir al carrito

Los mejores resultados en AbeBooks

1.

Cristopher Moore, Stephan Mertens
Editorial: OUP Oxford 2011-08-11, Oxford (2011)
ISBN 10: 0199233217 ISBN 13: 9780199233212
Nuevos Tapa dura Cantidad: > 20
Librería
Blackwell's
(Oxford, OX, Reino Unido)
Valoración
[?]

Descripción OUP Oxford 2011-08-11, Oxford, 2011. hardback. Estado de conservación: New. Nº de ref. de la librería 9780199233212

Más información sobre esta librería | Hacer una pregunta a la librería

Comprar nuevo
EUR 62,98
Convertir moneda

Añadir al carrito

Gastos de envío: EUR 3,35
De Reino Unido a Estados Unidos de America
Destinos, gastos y plazos de envío

2.

Mertens, Stephan
Editorial: OUP Oxford (2011)
ISBN 10: 0199233217 ISBN 13: 9780199233212
Nuevos Cantidad: > 20
Librería
Books2Anywhere
(Fairford, GLOS, Reino Unido)
Valoración
[?]

Descripción OUP Oxford, 2011. HRD. Estado de conservación: New. New Book. Shipped from UK in 4 to 14 days. Established seller since 2000. Nº de ref. de la librería FU-9780199233212

Más información sobre esta librería | Hacer una pregunta a la librería

Comprar nuevo
EUR 56,72
Convertir moneda

Añadir al carrito

Gastos de envío: EUR 10,06
De Reino Unido a Estados Unidos de America
Destinos, gastos y plazos de envío

3.

Cristopher Moore
ISBN 10: 0199233217 ISBN 13: 9780199233212
Nuevos Cantidad: 1
Librería
Book Park
(Southfield, MI, Estados Unidos de America)
Valoración
[?]

Descripción Estado de conservación: New. Brand New Book. Nº de ref. de la librería 0199233217BYR

Más información sobre esta librería | Hacer una pregunta a la librería

Comprar nuevo
EUR 68,31
Convertir moneda

Añadir al carrito

Gastos de envío: GRATIS
A Estados Unidos de America
Destinos, gastos y plazos de envío

4.

Cristopher Moore; Stephan Mertens
ISBN 10: 0199233217 ISBN 13: 9780199233212
Nuevos Cantidad: > 20
Librería
BWB
(Valley Stream, NY, Estados Unidos de America)
Valoración
[?]

Descripción Estado de conservación: New. Depending on your location, this item may ship from the US or UK. Nº de ref. de la librería 97801992332120000000

Más información sobre esta librería | Hacer una pregunta a la librería

Comprar nuevo
EUR 68,64
Convertir moneda

Añadir al carrito

Gastos de envío: GRATIS
A Estados Unidos de America
Destinos, gastos y plazos de envío

5.

Cristopher Moore,Stephan Mertens
Editorial: OUP Oxford 2011-06 (2011)
ISBN 10: 0199233217 ISBN 13: 9780199233212
Nuevos Cantidad: 4
Librería
Chiron Media
(Wallingford, Reino Unido)
Valoración
[?]

Descripción OUP Oxford 2011-06, 2011. Estado de conservación: New. Brand new book, sourced directly from publisher. Dispatch time is 24-48 hours from our warehouse. Book will be sent in robust, secure packaging to ensure it reaches you securely. Nº de ref. de la librería NU-GRD-04746646

Más información sobre esta librería | Hacer una pregunta a la librería

Comprar nuevo
EUR 66,62
Convertir moneda

Añadir al carrito

Gastos de envío: EUR 3,34
De Reino Unido a Estados Unidos de America
Destinos, gastos y plazos de envío

6.

Cristopher Moore; Stephan Mertens
Editorial: Oxford University Press
ISBN 10: 0199233217 ISBN 13: 9780199233212
Nuevos Cantidad: > 20
Librería
INDOO
(Avenel, NJ, Estados Unidos de America)
Valoración
[?]

Descripción Oxford University Press. Estado de conservación: New. Brand New. Nº de ref. de la librería 0199233217

Más información sobre esta librería | Hacer una pregunta a la librería

Comprar nuevo
EUR 69,57
Convertir moneda

Añadir al carrito

Gastos de envío: EUR 2,98
A Estados Unidos de America
Destinos, gastos y plazos de envío

7.

Cristopher Moore, Stephan Mertens
Editorial: Oxford University Press, United Kingdom (2011)
ISBN 10: 0199233217 ISBN 13: 9780199233212
Nuevos Tapa dura Cantidad: 10
Librería
The Book Depository US
(London, Reino Unido)
Valoración
[?]

Descripción Oxford University Press, United Kingdom, 2011. Hardback. Estado de conservación: New. Language: English . Brand New Book. 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. Nº de ref. de la librería AOP9780199233212

Más información sobre esta librería | Hacer una pregunta a la librería

Comprar nuevo
EUR 73,27
Convertir moneda

Añadir al carrito

Gastos de envío: GRATIS
De Reino Unido a Estados Unidos de America
Destinos, gastos y plazos de envío

8.

Stephan Mertens, Cristopher Moore
Editorial: Oxford University Press, United Kingdom (2011)
ISBN 10: 0199233217 ISBN 13: 9780199233212
Nuevos Tapa dura Cantidad: 10
Librería
The Book Depository
(London, Reino Unido)
Valoración
[?]

Descripción Oxford University Press, United Kingdom, 2011. Hardback. Estado de conservación: New. Language: English . Brand New Book. 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. Nº de ref. de la librería AOP9780199233212

Más información sobre esta librería | Hacer una pregunta a la librería

Comprar nuevo
EUR 73,78
Convertir moneda

Añadir al carrito

Gastos de envío: GRATIS
De Reino Unido a Estados Unidos de America
Destinos, gastos y plazos de envío

9.

Cristopher Moore; Stephan Mertens
ISBN 10: 0199233217 ISBN 13: 9780199233212
Nuevos Cantidad: 2
Librería
Speedy Hen
(London, Reino Unido)
Valoración
[?]

Descripción Estado de conservación: New. Bookseller Inventory # ST0199233217. Nº de ref. de la librería ST0199233217

Más información sobre esta librería | Hacer una pregunta a la librería

Comprar nuevo
EUR 55,72
Convertir moneda

Añadir al carrito

Gastos de envío: EUR 21,27
De Reino Unido a Estados Unidos de America
Destinos, gastos y plazos de envío

10.

Cristopher Moore, Stephan Mertens
Editorial: Oxford University Press, USA (2011)
ISBN 10: 0199233217 ISBN 13: 9780199233212
Nuevos Tapa dura Cantidad: 1
Librería
Ergodebooks
(RICHMOND, TX, Estados Unidos de America)
Valoración
[?]

Descripción Oxford University Press, USA, 2011. Hardcover. Estado de conservación: New. Nº de ref. de la librería DADAX0199233217

Más información sobre esta librería | Hacer una pregunta a la librería

Comprar nuevo
EUR 75,65
Convertir moneda

Añadir al carrito

Gastos de envío: EUR 3,40
A Estados Unidos de America
Destinos, gastos y plazos de envío

Existen otras copia(s) de este libro

Ver todos los resultados de su búsqueda