Scott Aaronson on Computational Complexity, Philosophy & Quantum Computing | Philosophical Trials #6
Scott Aaronson is a world-renowned expert in the fields of Quantum Computing and Computational Complexity Theory. He is a David J. Bruton Centennial Professor of Computer Science at The University of Texas at Austin. Prof. Aaronson is known by most computing enthusiasts for his extremely clear and engaging way of communicating difficult theoretical ideas. His book 'Quantum Computing since Democritus' is a wonderful resource of dipping into the topics that we are discussing in this episode.
Conversation outline:
00:00 Introduction
01:04 What draws you to Philosophy?
04:36 The importance of focusing of subproblems of the big questions: insights into space, time and thinking machines
09:19 The Turing Test and the chinese room argument
15:37 What other philosophical areas would benefit from looking at Complexity Theory?
21:35 What is Computational Complexity after all?
30:03 NP, complexity classes and the P=NP problem
45:27 Complexity Theory in light of time and memory limitations
52:24 Why do we believe in Quantum Theory?
55:36 What is Quantum Computing?
01:05:45 How are qubits physically implemented?
01:11:14 Quantum Supremacy
01:13:26 Would the construction of a quantum computer which could run Shor’s algorithm confirm the many-worlds interpretation? Remarks on David Deutsch’s quantum views.
Enjoy!
Apple Podcasts:
https://podcasts.apple.com/gb/podcast/philosophical-trials/id1513707135
Spotify:
https://open.spotify.com/show/3Sz88leU8tmeKe3MAZ9i10
Google Podcasts:
https://podcasts.google.com/?q=philosophical%20trials
Instagram:
https://www.instagram.com/tedynenu/
Видео Scott Aaronson on Computational Complexity, Philosophy & Quantum Computing | Philosophical Trials #6 канала Philosophical Trials
Conversation outline:
00:00 Introduction
01:04 What draws you to Philosophy?
04:36 The importance of focusing of subproblems of the big questions: insights into space, time and thinking machines
09:19 The Turing Test and the chinese room argument
15:37 What other philosophical areas would benefit from looking at Complexity Theory?
21:35 What is Computational Complexity after all?
30:03 NP, complexity classes and the P=NP problem
45:27 Complexity Theory in light of time and memory limitations
52:24 Why do we believe in Quantum Theory?
55:36 What is Quantum Computing?
01:05:45 How are qubits physically implemented?
01:11:14 Quantum Supremacy
01:13:26 Would the construction of a quantum computer which could run Shor’s algorithm confirm the many-worlds interpretation? Remarks on David Deutsch’s quantum views.
Enjoy!
Apple Podcasts:
https://podcasts.apple.com/gb/podcast/philosophical-trials/id1513707135
Spotify:
https://open.spotify.com/show/3Sz88leU8tmeKe3MAZ9i10
Google Podcasts:
https://podcasts.google.com/?q=philosophical%20trials
Instagram:
https://www.instagram.com/tedynenu/
Видео Scott Aaronson on Computational Complexity, Philosophy & Quantum Computing | Philosophical Trials #6 канала Philosophical Trials
Показать
Комментарии отсутствуют
Информация о видео
Другие видео канала
![Simon Blackburn on Philosophy, Truth and Morality | Philosophical Trials #2](https://i.ytimg.com/vi/sckmAGcq9Ec/default.jpg)
![What Quantum Computing Isn't | Scott Aaronson | TEDxDresden](https://i.ytimg.com/vi/JvIbrDR1G_c/default.jpg)
![Scott Aaronson on Computational Complexity Theory and Quantum Computers](https://i.ytimg.com/vi/0jrybODBUpA/default.jpg)
![Timothy Williamson on Relativism and Vagueness | Philosophical Trials #8](https://i.ytimg.com/vi/qpyrJrBnVdU/default.jpg)
![Tim Crane on Minds, Artificial Intelligence and Consciousness | Philosophical Trials #3](https://i.ytimg.com/vi/0uTP-dQ4GNg/default.jpg)
![Quantum Computing for Computer Scientists](https://i.ytimg.com/vi/F_Riqjdh2oM/default.jpg)
![Keynote David Snowden, PhD: Combining Complexity Theory with Narrative Research](https://i.ytimg.com/vi/pHjeFFGug1Y/default.jpg)
![Scott Aaronson: Quantum Computing | Lex Fridman Podcast #72](https://i.ytimg.com/vi/uX5t8EivCaM/default.jpg)
![Kai von Fintel on Language, Semantics and Possible Worlds | Philosophical Trials #5](https://i.ytimg.com/vi/BWVCrDT4ga4/default.jpg)
![The Race For Quantum Supremacy](https://i.ytimg.com/vi/1lIfbqfoGMo/default.jpg)
![Cristian Presură despre Știință, Mecanică Cuantică și Filosofie | Philosophical Trials (RO) Ep. 2](https://i.ytimg.com/vi/-t8bjs_Goe4/default.jpg)
![Firewalls, AdS/CFT, and the Complexity of States and Unitaries...- Scott Aaronson](https://i.ytimg.com/vi/yCChR2HgCgc/default.jpg)
![Closing Keynote: Quantum Computing: Reality vs. Hype - John Preskill - 6/27/2019](https://i.ytimg.com/vi/QUGnaLh6QLI/default.jpg)
![Quantum Computing: Untangling the Hype](https://i.ytimg.com/vi/wE1OCXvaDtc/default.jpg)
![A beginner's guide to quantum computing | Shohini Ghose](https://i.ytimg.com/vi/QuR969uMICM/default.jpg)
![Mindscape 99 | Scott Aaronson on Complexity, Computers, and Quantum Gravity](https://i.ytimg.com/vi/qD4XkFndaFk/default.jpg)
![Scott Aaronson @ Theory Lunch](https://i.ytimg.com/vi/XupYmIUj_ys/default.jpg)
![Scott Aaronson: What is a Quantum Computer? | AI Podcast Clips](https://i.ytimg.com/vi/nK9pzRevsHQ/default.jpg)
![Scott Aaronson "On the Nature of Proof"](https://i.ytimg.com/vi/tpOHKaocMuM/default.jpg)
![Thomas Cormen on The CLRS Textbook, P=NP and Computer Algorithms | Philosophical Trials #7](https://i.ytimg.com/vi/GDwqQjfehKE/default.jpg)