Undergrad Complexity at CMU - Lecture 28: Why is P vs. NP Difficult?
Undergraduate Computational Complexity Theory Lecture 28: Why is P vs. NP Difficulty? Carnegie Mellon Course 15-455, Spring 2017 (http://www.cs.cmu.edu/~15455/) Taught by Ryan O'Donnell (http://www.cs.cmu.edu/~odonnell) Suggested reading: Sipser Ch. 9.2 Filmed by Panopto (http://www.panopto.com/)
▶︎
Guest Speaker | "P vs NP" by Professor Michael Sipser
▶︎
Vijaya Ramachandran, P versus NP
▶︎
P vs. NP and the Computational Complexity Zoo
▶︎
We're 99.9% sure this pattern is true, but no one can prove it
▶︎
5. Trees | CMU Principles of Functional Programming M23
▶︎
William Dunham, A tribute to Euler
▶︎
The Arrow of Time in Causal Networks
▶︎
Beyond Computation: The P versus NP question
▶︎
Ludwig Wittgenstein's Philosophy - John Searle & Bryan Magee (1987)
▶︎
The Obviously True Theorem No One Can Prove
▶︎
Terence Tao on the cosmic distance ladder
▶︎
If You're an Engineer, This is for YOU | Don McMillan Full Stand-Up Special
▶︎
6. Monte Carlo Simulation
▶︎
The Big Short (2015): The Jenga Scene – Explaining the Financial Collapse
▶︎
Terence Tao: Nobody Understands Why AI Actually Works
▶︎
Ronny Chieng Address | Harvard Class Day 2026
▶︎
Yann LeCun: World Models: Enabling the next AI revolution
▶︎
The Formal Definition of P (P vs NP)
▶︎
Game Theory
▶︎