Kasparov on AI math: brute force beat humans at chess without thinking like us
stevenstrogatz · x · 2026-11-22
Garry Kasparov draws parallels between computer chess and the reported 250,000+ page AI-assisted Riemann Hypothesis work. Chess engines on faster hardware proved brute force could surpass the best humans without "thinking like a human," and 7-8 piece tablebases produce forced mates hundreds of moves long that humans can't comprehend. He suggests math may likewise contain realms humans cannot understand, echoing physicist Kevin Schawinski's note that mathematics education prized elegance while AI shows an incomprehensible but apparently effective path.
More from AGI Musings
- TIME now sells ads hidden from humans and shown only to AI agents — Specialist_Lab_4226 · 2026-11-22
- RLVR trains models to maximize task reward — long-term code maintainability is on you — bendee983 · 2026-11-22
- Kenneth Stanley: AI's Riemann proof vindicates 'Why Greatness Cannot Be Planned' — kenneth0stanley · 2026-11-22
- Fields medallist Tim Gowers speaks at London March Against AI Extinction — birchlse · 2026-11-22
- Guardian investigates the uncharted trauma of breaking up with AI companions — TobyWalsh · 2026-11-22
- WaPo: 'Entitled and out of touch' AI CEOs heading for a fall as sentiment turns — GaryMarcus · 2026-11-22