Can we prove P=NP and not find the algorithm? | Scott Aaronson and Lex Fridman Published 2020-10-21 Download video MP4 360p Recommendations 06:33 The odds that P=NP is 3% | Scott Aaronson and Lex Fridman 11:20 Donald Knuth: P=NP | AI Podcast Clips 19:34 The Problem with Human Specialness in the Age of AI | Scott Aaronson | TEDxPaloAlto 06:14 Turing & The Halting Problem - Computerphile 12:30 Complexity of Quantum Computation | Scott Aaronson and Lex Fridman 33:03 NP-COMPLETENESS - The Secret Link Between Thousands of Unsolved Math Problems 09:04 The consciousness ghost in the quantum machine | Scott Aaronson and Lex Fridman 04:54 The problem in Good Will Hunting - Numberphile 10:53 What Makes Mario NP-Hard? (Polynomial Reductions) 40:55 The Bell Curve: The most controversial book ever in science | Richard Haier and Lex Fridman 06:14 What programming language to learn | Chris Lattner and Lex Fridman 05:49 P vs NP on TV - Computerphile 11:14 The Man Who Solved the World’s Hardest Math Problem 10:44 P vs. NP and the Computational Complexity Zoo 03:36 If P=NP, you can break every encryption in the world | Scott Aaronson and Lex Fridman 03:58 What will the P=NP proof look like? | Cal Newport and Lex Fridman 04:38 Does P=NP? | Po-Shen Loh and Lex Fridman 1:34:44 Jim Keller: Moore's Law, Microprocessors, and First Principles | Lex Fridman Podcast #70 04:21 Does P=NP? | Richard Karp and Lex Fridman 2:17:07 Scott Aaronson: The Greatest Unsolved Problem in Math Similar videos 02:50 Proving P=NP Requires Concepts We Don't Have | Richard Karp and Lex Fridman 06:03 Theory of Everything | Scott Aaronson and Lex Fridman 21:55 Scott Aaronson: What is a Quantum Computer? | AI Podcast Clips 06:42 Universality of Computation is Beautiful | Scott Aaronson and Lex Fridman 16:04 Scott Aaronson: Quantum Supremacy | AI Podcast Clips 24:32 Quantum Computing and the P vs. NP Problem. More results