Riemann breakthrough shakes the calibration: 'hard' problems may just be search problems
burny_tech · x · 2026-11-21
Reacting to the Riemann hypothesis proof claim, corsaren revisits a difficulty-calibration graph: we judge problem difficulty by whether it's solved and how visible the path is, but unsolved ≠ hard — AI-enabled approaches may turn 'transformative' problems into search problems. Quoted mathematician ObhishekSaha admits he expected RH to need massive new theory-building in arithmetic geometry, yet the proof took a completely different route.
More from AGI Musings
- Only when infra resources burn out will the application layer see its spring — yangyi · 2026-11-21
- After GRH falls, mathematicians debate building more lighthouse problems for AI era — burny_tech · 2026-11-21
- Cyberpunk meme: reality now includes AI math solvers, drone warfare and rogue botnets — StewartalsopIII · 2026-11-21
- Mathematician Levent Alpöge went from proving theorems with Bhargava to working with Claude — burny_tech · 2026-11-21
- Reading old books matters: without them you're a hostage to the present — 0xkarasy · 2026-11-21
- Which job will be the last one AI can't replace? Reddit votes plumber — No-Childhood-113 · 2026-11-21