✨
AI Summary
- Scott Aaronson discusses computational complexity and the P vs NP problem.
- Explores the difficulty of solving versus verifying computational problems.
- Insights into the theoretical limits of computation are shared.
Guests on This Episode
QG
Quantum Gravity
4 podcast appearances
SC
Scott Aaronson on Complexity
1 podcast appearance