Scott Aaronson: The Greatest Unsolved Problem in Math Published 2023-12-05 Download video MP4 360p Recommendations 19:34 The Problem with Human Specialness in the Age of AI | Scott Aaronson | TEDxPaloAlto 33:03 NP-COMPLETENESS - The Secret Link Between Thousands of Unsolved Math Problems 24:22 Refuting Eric Weinstein's and Stephen Wolfram's Theories of Everything | Scott Aaronson & Tim Nguyen 1:31:07 Quantum Consciousness Debate: Does the Wave Function Actually Exist? | Penrose, Faggin & Kastrup 19:12 Biggest Breakthroughs in Math: 2023 40:56 Kryon State of the Earth Address (русские субтитры) 43:15 Did Einstein Crack the Biggest Problem in Physics…and Not Know It? 13:22 Bell's Inequality: The weirdest theorem in the world | Nobel Prize 2022 20:30 Does Superdeterminism save Quantum Mechanics? Or does it kill free will and destroy science? 31:52 Testing Eric Weinstein's and Stephen Wolfram's Theories of Everything | Ethan Siegel & Tim Nguyen 2:00:41 Stephen Wolfram on Observer Theory 35:19 Can Particles be Quantum Entangled Across Time? 18:22 Physicist explains quantum computers | Guillaume Verdon and Lex Fridman 15:33 P vs. NP - The Biggest Unsolved Problem in Computer Science 1:09:42 The Mystery of Spinors 48:00 Interview about AI - Dr Alan D. Thompson on OpenAI's New o1 Model Is a Really Big Deal (Sep/2024) 18:25 Does the Many Worlds Interpretation make sense? 17:23 Quantum Computing with Light: The Breakthrough? 31:21 Is Quantum Reality in the Eye of the Beholder? 22:09 The Simplest Math Problem No One Can Solve - Collatz Conjecture Similar videos 03:19 Can we prove P=NP and not find the algorithm? | Scott Aaronson and Lex Fridman 15:51 What Quantum Computing Isn't | Scott Aaronson | TEDxDresden 02:50 Proving P=NP Requires Concepts We Don't Have | Richard Karp and Lex Fridman 58:19 Prof. Scott Aaronson - Quantum Computing and the Limits of the Efficiently Computable 03:36 If P=NP, you can break every encryption in the world | Scott Aaronson and Lex Fridman 06:33 The odds that P=NP is 3% | Scott Aaronson and Lex Fridman 19:44 P vs. NP: The Biggest Puzzle in Computer Science 33:26 Scott Aaronson 1.1, NP-complete Problems and Physics (IAS | PCMI) 1:09:57 Quantum Computing and the Limits of the Efficiently Computable - 2011 Buhl Lecture 1:21:12 Scott Aaronson: Quantum Computing, Unsolvable Problems, & Artificial Intelligence — #9 1:06:14 Scott Aaronson, MIT, "Computational Complexity, and Fundamental Physics" 1:01:37 Scott Aaronson - Complexity and computability with closed timelike curves [2018] 1:43:30 Qantum Computing, Theory of Complexity and ChatGPT - Prof Scott Aaronson 10:44 P vs. NP and the Computational Complexity Zoo 1:52:55 Mindscape 99 | Scott Aaronson on Complexity, Computers, and Quantum Gravity 11:30 Scott Aaronson - Is the Cosmos a Computer? More results