Quantum Computing since Democritus: Ausgezeichnet: Choice Outstanding Academic Title 2013

Aaronson, Scott:

ISBN 10: 0521199565 / ISBN 13: 9780521199568

Edité par Cambridge University Press, 2013

A propos de cet article

Gutes Exemplar, geringe Gebrauchsspuren, Cover/SU berieben/bestoßen, innen alles in Ordnung; Good copy, light signs of previous use, cover/dust jacket shows some rubbing/wear, interior in good condition. B240923ah241 ISBN: 9780521199568 Sprache: Englisch Gewicht in Gramm: 653.

N° de réf. du vendeur 706485

Détails bibliographiques

• Titre: Quantum Computing since Democritus: Ausgezeichnet: Choice Outstanding Academic Title 2013
• Éditeur: Cambridge University Press
• Date de parution: 2013
• Langue: anglais
• ISBN à 10 chiffres: 0521199565
• ISBN à 13 chiffres: 9780521199568
• Reliure: Softcover
• État de l'article: Gut
• Catalogues du vendeur:
  • Englischsprachige Bücher

A propos de ce titre

Synopsis

Written by noted quantum computing theorist Scott Aaronson, this book takes readers on a tour through some of the deepest ideas of maths, computer science and physics. Full of insights, arguments and philosophical perspectives, the book covers an amazing array of topics. Beginning in antiquity with Democritus, it progresses through logic and set theory, computability and complexity theory, quantum computing, cryptography, the information content of quantum states and the interpretation of quantum mechanics. There are also extended discussions about time travel, Newcomb's Paradox, the anthropic principle and the views of Roger Penrose. Aaronson's informal style makes this fascinating book accessible to readers with scientific backgrounds, as well as students and researchers working in physics, computer science, mathematics and philosophy.

À propos de l?auteur

Scott Aaronson is an Associate Professor of Electrical Engineering and Computer Science at the Massachusetts Institute of Technology. Considered one of the top quantum complexity theorists in the world, he is well known for both his research in quantum computing and computational complexity theory and for his widely read blog Shtetl-Optimized. Professor Aaronson also created Complexity Zoo, an online encyclopedia of computational complexity theory and has written popular articles for Scientific American and The New York Times. His research and popular writing have earned him numerous awards, including the United States Presidential Early Career Award for Scientists and Engineers and the Alan T. Waterman Award.