Quantum Computing, Complexity Theory & AI ft. Scott Aaronson | Know Time 119

Scott Aaronson, theoretical computer scientist, professor at University of Texas Austin and leading innovator in quantum computing and complexity theory, talks about AI consciousness, can machines think, universality, quantum computing, computation complexity, P complexity, NP complexity, P vs. NP and consciousness. Scott: https://scottaaronson.blog/ SUPPORT: Patreon: https://www.patreon.com/knowtime Anchor: https://anchor.fm/knowtime/support Youtube Membership: https://www.youtube.com/channel/UCJ-937lA3_s2g5AxdpKQjVg/join PODCAST: Anchor: https://anchor.fm/knowtime Spotify: https://open.spotify.com/show/2CjRJPktODLDeHavCNDLGA Apple Podcasts: https://podcasts.apple.com/us/podcast/know-time/id1535371851?uo=4 CONNECT: Youtube: Subscribe! Instagram: https://www.instagram.com/knowtimetofly/ Instagram (Personal): https://www.instagram.com/shalajlawania/ Twitter: https://twitter.com/knowtimetofly Twitter (Personal): https://twitter.com/shalajlawania Facebook: https://www.facebook.com/knowtimetofly Reddit: https://www.reddit.com/r/knowtimetofly/ Blog: http://www.sadisticshalpy.com/ Producer & Host: Shalaj Lawania TIMELINE 0:00 Introduction 1:29 Can Machines Think? 7:35 The Computational Universe 19:11 Simulation Hypothesis 23:30 Universality 31:58 What Is Quantum Computing? 40:28 Classical Computers vs. Quantum Computers 56:06 What Is Computational Complexity Theory? 1:02:19 P Complexity Class 1:07:14 NP Complexity Class 1:13:43 P vs. NP 1:22:30 Consciousness 1:33:42 Lego Interpretation 1:34:31 Inspirations (Books, Movies, Role Models) 1:37:31 Legacy & Meaning of Life #computerscience #quantumcomputing