Proving P=NP Requires Concepts We Don't Have | Richard Karp and Lex Fridman Published 2020-07-28 Download video MP4 360p Recommendations 11:20 Donald Knuth: P=NP | AI Podcast Clips 10:44 P vs. NP and the Computational Complexity Zoo 16:26 NP-Completeness | Richard Karp and Lex Fridman 06:14 Turing & The Halting Problem - Computerphile 15:58 Free will is not an illusion | Denis Noble 06:34 When Computers Write Proofs, What's the Point of Mathematicians? 04:21 Does P=NP? | Richard Karp and Lex Fridman 10:10 P vs. NP - An Introduction 08:21 Brothers Karamazov by Dostoevsky is the greatest book ever written | Jordan Peterson and Lex Fridman 20:24 The Impossible Problem NO ONE Can Solve (The Halting Problem) 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 42:33 Beyond Computation: The P versus NP question (panel discussion) 22:09 The Simplest Math Problem No One Can Solve - Collatz Conjecture 10:53 What Makes Mario NP-Hard? (Polynomial Reductions) 17:25 The end of good and evil | Slavoj Žižek, Rowan Williams, Maria Balaska, Richard Wrangham 07:27 Why is P vs NP Important? 05:49 P vs NP on TV - Computerphile 12:59 The Boundary of Computation 04:38 Does P=NP? | Po-Shen Loh and Lex Fridman Similar videos 03:19 Can we prove P=NP and not find the algorithm? | Scott Aaronson and Lex Fridman 03:58 What will the P=NP proof look like? | Cal Newport and Lex Fridman 03:36 If P=NP, you can break every encryption in the world | Scott Aaronson and Lex Fridman 05:58 A Neural Network Is a Circuit | Richard Karp and Lex Fridman 13:12 Randomized Algorithms | Richard Karp and Lex Fridman 04:42 What Are Combinatorial Algorithms? | Richard Karp and Lex Fridman 39:33 P=NP? More results