Roko's Bet: If AI Solves P vs NP Soon, It'll Be P=NP Via an Ugly Algorithm
jessi_cata · x · 2026-09-09
In a discussion on the limits of AI mathematics, Roko Mijic made a concrete prediction: if AI resolves P vs NP soon, it will most likely prove P does equal NP — via an explicit, "outrageously ugly" algorithm that dodges two of the three known proof barriers.
- He expects AI math to keep picking low-hanging fruits for years: counterexamples, proofs by exhausting hundreds of cases
- In his view that's "more of the same, at a more rapid rate," not a qualitative leap
Related event: Roko predicts AI will prove P=NP with an ugly algorithm(3 posts)→
More from AGI Musings
- You traded friends for strangers in the feed; next come AI personas — r0ck3t23 · 2026-10-26
- CS professor: don't hide your AI use from future employers, lead with it — lemire · 2026-10-26
- Engineer: AI-cheap engineering will change which manufacturing jobs get a yes — burhop · 2026-10-26
- FixItBench: the joke benchmark where robot-agent teams race to repair electron microscopes — teortaxesTex · 2026-10-26
- Instructor advice: record and save all your teaching materials for future AI use — prof_g · 2026-10-26
- Jason Furman: Building Econvitals pre-AI would need ~50 people, 3 years, $20M — HarrySurden · 2026-10-26