99 | Scott Aaronson on Complexity, Computation, and Quantum Gravity
There are some problems for which it's very hard to find the answer, but very easy to check the answer if someone gives it to you. At least, we think there are such problems; whether or not they really exist is the famous P vs NP problem, and actually proving it will win you a million dollars. This kind of question…
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 Sean Carroll's Mindscape: Science, Society, Philosophy, Culture, Arts, and Ideas
See all episodes →
74%359 | Solo: Theories of Dark Energy
74%349 | Daniel Harlow on What Quantum Gravity Teaches Us About Quantum Mechanics
73%363 | Chandra Sripada on How LLMs and Humans are Cognitive Cousins
Similar episodes from other shows
More like Sean Carroll's Mindscape: Science, Society, Philosophy, Culture, Arts, and Ideas →
Scott Aaronson - Quantum Computing, Complexity, and Creativity
#130 – Scott Aaronson: Computational Complexity and Consciousness
#83 - Scott Aaronson
Sean Carroll || the Origins of Life, Meaning, and the Universe
One great episode in your inbox, daily — free.
One email a day, unsubscribe anytime. No spam, ever.