Quantum Complexity: Scott Aaronson on P vs NP and the Future
In this episode of the 632nm podcast, Scott Aaronson shares his early fascination with calculus at age 11 and how “rediscovering” old mathematics led him toward groundbreaking work in complexity theory. He gives a lucid explanation of P vs NP, revealing how seemingly trivial questions about verifying solutions speak…
We score an episode from what we can actually measure — its reach and engagement, what listeners say about it, and what it covers. We don't have those signals for this one yet, so it doesn't get a number.
Buzzmeter says it's buzzing across platforms — the Hive Vote says whether the people who actually listened liked it.
Rate this episode
Add your vote to the Hive — listeners rate every episode after they finish.
- No reviews yet — be the first.
More from 632nm
See all episodes →The Hybrid Architecture Behind Quantum Computing | Yonatan Cohen Quantum Machines CTO
How DNA Sequencing Was Discovered By Accident | Walter Gilbert on Biogen, Industry, and Art
How Bacteria Evolved Rotary Motors | Michael Manson
Similar episodes from other shows
More like 632nm →
99 | Scott Aaronson on Complexity, Computation, and Quantum Gravity
Scott Aaronson - Quantum Computing, Complexity, and Creativity
How Quantum Computing Actually Works (Part 1) (EP 54)
#72 – Scott Aaronson: Quantum Computing
One great episode in your inbox, daily — free.
One email a day, unsubscribe anytime. No spam, ever.