NYT: OpenAI breakthrough challenges the Exponential Time Hypothesis, shaking a CS tenet
fortnow · x · 2026-11-07
- The New York Times (Cade Metz) reports OpenAI achieved a breakthrough on the Exponential Time Hypothesis, undermining a long-standing tenet of computational complexity theory.
- Using Sudoku as an analogy for P vs NP, the piece explains the assumption that solving is far harder than checking — and how OpenAI's result challenges it, hinting at radical new efficiencies.
- The problem is one of the Clay Institute's Millennium Prize Problems; the Simons Institute amplified the story featuring Russell Impagliazzo and Seth Lloyd.
More from AGI Musings
- Seb Krier lays out his AI safety views: misuse and institutional failure over scheming AIs — sebkrier · 2026-11-07
- Podcast uses Hindu karma concept to frame shared responsibility for AI harms — krvarshney · 2026-11-07
- TBPN Interview: AI in Drug Discovery, GLP-1s, and China's Biotech Rise — jordihays · 2026-11-07
- Has anyone notable from the Pause AI movement flipped? ChrisGPT asks why — ChrisGPT · 2026-11-07
- DREADDs: a new drug modality that works in humans, with a clear path to AI-driven design — anshulkundaje · 2026-11-07
- Muse rolls out voice avatars as designers slam its 'cute' mascot for weaponizing empathy — joonasvirtanen · 2026-11-07