Can AI solve P vs NP? | Lex Fridman
Lex Clips · 10:38 · Watch on YouTube
The core claim is that P vs NP remains extremely hard for AI to crack because we lack even basic lower bounds for SAT, and that complexity theory must move beyond worst-case analysis to model realistic structure.