Researcher rebuts the 'brute force was always known' take on AI math proofs
teortaxesTex · x · 2026-11-21
Peter Schmidt-Nielsen pushes back on the claim that "we always knew we could just brute force these problems and found it uninteresting." He argues the truth is the opposite: if in 2015 anyone could propose a sampling procedure with even a 10^-10 chance of producing a valid proof of the Riemann hypothesis, it would have been considered the pinnacle of intelligence. A defense of AI's brute-force-style reasoning as genuinely intelligent.
Related event: Claude-assisted Riemann hypothesis claim sparks skepticism(54 posts)→
More from AGI Musings
- Yudkowsky: an AI proving the Riemann Hypothesis is only a matter of time — ESYudkowsky · 2026-11-21
- ChatGPT will win AI because 1.2B+ use the app, argues founder when models reach parity — alexmacgregor__ · 2026-11-21
- Mathematician littmath: my mom just texted me her own p(doom) — littmath · 2026-11-21
- Coding Is Dead, Not Software: Good Software Is a Set of Strong Opinions — pramodk73 · 2026-11-21
- Gary Marcus: it's tech bros, not the machine, ignoring human work — GaryMarcus · 2026-11-21
- Award-winning novel flagged 99% AI-generated by Pangram; publisher upholds prize anyway — GarrisonLovely · 2026-11-21