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
- Math Professor Roasts Anima Anandkumar's Navier-Stokes Reply-Guying as 'Crypto Scam'-Like — suchenzang · 2026-09-09
- OpenAI only attempted the Navier-Stokes solve after hearing a rumor it was possible — kohjingyu · 2026-09-09
- Keller Jordan: treat novel instances of human misalignment as invaluable empirical data for alignment science — kellerjordan0 · 2026-09-09
- Ben Fielding: today's AI automates knowledge work, not judgment — next era needs world models for decision advantage — benfielding · 2026-09-09
- Investors ask AI the same questions, herd into the same low-quality stocks — toptickcrypto · 2026-09-09
- Metaculus' original AGI question finally meets its criteria, ending an era — AndyMasley · 2026-09-09