Soon the interesting bit in math is minimizing Kolmogorov complexity of proofs
gordic_aleksa · x · 2026-11-22
Aleksa Gordić predicts that with AI entering mathematics, the interesting question will shift from whether we can solve a problem to whether we can minimize the Kolmogorov complexity of its proof.
More from AGI Musings
- V.E. Schwab: Writing is an art, publishing is a business — david_perell · 2026-11-22
- Asking basic questions in the AI era: don't let gaps feel like verdicts — brandongalang · 2026-11-22
- Claude predicts AI will crack math proofs, battery materials and abandoned drug candidates within 5 years — alex_verem · 2026-11-22
- Optogenetics could have been invented in the 1970s — how common are biology's 'delayed inventions'? — NikoMcCarty · 2026-11-22
- Most math will never be proved: shortest proofs are astronomically long, says dev — LLMs don't change that — jfischoff · 2026-11-22
- Oxford's Toby Ord Pushes Back on Claims AI Gives Anthropic 10x Research Speedup — tobyordoxford · 2026-11-22