Grant Sanderson – AI and the future of math
Dwarkesh Podcast · ~94 min · Listen
- 3Blue1Brown’s Grant Sanderson discusses why AI progresses faster in mathematics than most other domains, and what that implies for AI capability more broadly.
- Key framework: math (like coding) benefits from verifiability, determinism, and “grindability” (cheap parallel simulation); real-world domains like web automation lack this due to rate limits and non-determinism — echoing themes from Dwarkesh’s own essays that same month.
- Distinguishes proving a result from understanding why it’s true — cites Galois theory, whose value took the mathematical community roughly a century to recognize, as evidence that “the verification loop on conceptual breakthroughs can be a century long.”
- Argues AI’s core mathematical limitation is at the level of concept/definition creation, not theorem-proving, and that AI’s weakness in writing stems from a lack of theory of mind about the reader.
- Takeaway: human value in math (and knowledge work generally) may shift toward curation, problem selection, and definition-creation rather than raw proof generation.