Dekorationsartikel gehören nicht zum Leistungsumfang.
Sprache:
Englisch
51,45 €*
Versandkostenfrei per Post / DHL
auf Lager, Lieferzeit 1-2 Werktage
Kategorien:
Beschreibung
Takes students and researchers on a tour through some of the deepest ideas of maths, computer science and physics.
Takes students and researchers on a tour through some of the deepest ideas of maths, computer science and physics.
Über den Autor
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.
Inhaltsverzeichnis
1. Atoms and the void; 2. Sets; 3. Gödel, Turing, and friends; 4. Minds and machines; 5. Paleocomplexity; 6. P, NP, and friends; 7. Randomness; 8. Crypto; 9. Quantum; 10. Quantum computing; 11. Penrose; 12. Decoherence and hidden variables; 13. Proofs; 14. How big are quantum states?; 15. Skepticism of quantum computing; 16. Learning; 17. Interactive proofs and more; 18. Fun with the Anthropic Principle; 19. Free will; 20. Time travel; 21. Cosmology and complexity; 22. Ask me anything.
Details
Erscheinungsjahr: | 2013 |
---|---|
Genre: | Informatik |
Rubrik: | Naturwissenschaften & Technik |
Medium: | Taschenbuch |
Inhalt: | Kartoniert / Broschiert |
ISBN-13: | 9780521199568 |
ISBN-10: | 0521199565 |
Sprache: | Englisch |
Einband: | Kartoniert / Broschiert |
Autor: | Aaronson, Scott |
Hersteller: | Cambridge University Pr. |
Abbildungen: | 25 b/w illus. |
Maße: | 229 x 152 x 22 mm |
Von/Mit: | Scott Aaronson |
Erscheinungsdatum: | 31.03.2013 |
Gewicht: | 0,583 kg |
Über den Autor
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.
Inhaltsverzeichnis
1. Atoms and the void; 2. Sets; 3. Gödel, Turing, and friends; 4. Minds and machines; 5. Paleocomplexity; 6. P, NP, and friends; 7. Randomness; 8. Crypto; 9. Quantum; 10. Quantum computing; 11. Penrose; 12. Decoherence and hidden variables; 13. Proofs; 14. How big are quantum states?; 15. Skepticism of quantum computing; 16. Learning; 17. Interactive proofs and more; 18. Fun with the Anthropic Principle; 19. Free will; 20. Time travel; 21. Cosmology and complexity; 22. Ask me anything.
Details
Erscheinungsjahr: | 2013 |
---|---|
Genre: | Informatik |
Rubrik: | Naturwissenschaften & Technik |
Medium: | Taschenbuch |
Inhalt: | Kartoniert / Broschiert |
ISBN-13: | 9780521199568 |
ISBN-10: | 0521199565 |
Sprache: | Englisch |
Einband: | Kartoniert / Broschiert |
Autor: | Aaronson, Scott |
Hersteller: | Cambridge University Pr. |
Abbildungen: | 25 b/w illus. |
Maße: | 229 x 152 x 22 mm |
Von/Mit: | Scott Aaronson |
Erscheinungsdatum: | 31.03.2013 |
Gewicht: | 0,583 kg |
Warnhinweis