| 000 | 00000cam u2200205 a 4500 | |
| 001 | 000046170949 | |
| 005 | 20250912170502 | |
| 008 | 240219s2013 enka b 001 0 eng | |
| 010 | ▼a 2012036798 | |
| 020 | ▼a 9780521199568 (pbk.) | |
| 020 | ▼a 0521199565 (pbk.) | |
| 035 | ▼a (KERIS)REF000017887089 | |
| 040 | ▼a DLC ▼b eng ▼c DLC ▼e rda ▼d DLC ▼d 211009 | |
| 042 | ▼a pcc | |
| 050 | 0 0 | ▼a QC174.17.M35 ▼b A27 2013 |
| 082 | 0 0 | ▼a 621.39/1 ▼2 23 |
| 084 | ▼a 621.391 ▼2 DDCK | |
| 090 | ▼a 621.391 ▼b A113q | |
| 100 | 1 | ▼a Aaronson, Scott, ▼d 1981- ▼0 AUTH(211009)173699. |
| 245 | 1 0 | ▼a Quantum computing since Democritus / ▼c Scott Aaronson. |
| 260 | ▼a Cambridge : ▼b Cambridge University Press, ▼c 2013 ▼g (2019 printing). | |
| 264 | 1 | ▼a Cambridge : ▼b Cambridge University Press, ▼c 2013. |
| 300 | ▼a xxxi, 371 p. : ▼b ill. ; ▼c 23 cm. | |
| 336 | ▼a text ▼2 rdacontent | |
| 337 | ▼a unmediated ▼2 rdamedia | |
| 338 | ▼a volume ▼2 rdacarrier | |
| 504 | ▼a Includes bibliographical references and index. | |
| 505 | 0 | ▼a 1. Atoms and the void -- 2. Sets -- 3. Gèodel, 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, circuit lower bounds, and more -- 18. Fun with the Anthropic Principle -- 19. Free will -- 20. Time travel -- 21. Cosmology and complexity -- 22. Ask me anything. |
| 505 | 8 | ▼a Machine generated contents note: 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. |
| 520 | ▼a "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"--Provided by publisher. | |
| 650 | 0 | ▼a Quantum theory ▼x Mathematics. |
| 650 | 0 | ▼a Quantum computers. |
| 945 | ▼a ITMT |
Holdings Information
| No. | Location | Call Number | Accession No. | Availability | Due Date | Make a Reservation | Service |
|---|---|---|---|---|---|---|---|
| No. 1 | Location Main Library/Western Books/ | Call Number 621.391 A113q | Accession No. 111893122 (1회 대출) | Availability In loan | Due Date 2026-03-09 | Make a Reservation Available for Reserve | Service |
Contents information
Book Introduction
Takes students and researchers on a tour through some of the deepest ideas of maths, computer science and physics.
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.
Information Provided By: :
Author Introduction
스콧 애론슨(지은이)
텍사스대학교 데이비드 제이 브루톤 센테니얼 컴퓨터 과학과 교수이자 양자정보센터 디렉터로, MIT 전기공학 및 컴퓨터 과학과 부교수일 때 이 책을 출간했다. 양자 복잡도 이론 전문가로서 세계 최고로 손꼽히며 양자 컴퓨팅과 계산 복잡도 이론 분야의 연구 성과뿐만 아니라 인기 있는 블로그인 'Shtetl-Optimized'로도 유명하다. 계산 복잡도 이론에 대한 온라인 백과사전인 복잡도 동물원(Complexity Zoo)을 만들었으며, <사이언티픽 아메리칸(Scientific American)>과 <뉴욕 타임즈(New York Times)>에 컬럼도 쓰고 있다. 연구 성과와 인기 있는 글에 대해 젊은 과학자와 공학자에게 주는 미국 대통령상(United States Presidential Early Career Award for Scientists and Engineers)과 앨런 T. 워터맨상을 비롯한 다양한 상을 받았다.
Table of Contents
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.