What counts as an 'elementary proof'? Sandberg unpacks the term's shifting meanings
anderssandberg · x · 2026-11-22
Anders Sandberg continues his thread on the Alpöge/Claude Riemann proof: historically, 'elementary' proofs in number theory avoid complex analysis, but the term can also mean avoiding branches of math (like abstract algebra) that a hypothetical audience is unfamiliar with. He cites the Computational Complexity blog's taxonomy of the term's many meanings.
Related event: Rethinking "Elementary Proofs": The Compression Power of Advanced Concepts(2 posts)→
More from Research
- Researchers find the first genetic code reading CUU/CUA as proline, in four yeast mitochondria — willdepue · 2026-11-22
- Blogger calls for an open-ended AI Cambrian explosion of mathematical diversity — burny_tech · 2026-11-22
- Open-source visloc-rs turns 360° camera street footage into a robot simulator via 3D Gaussian Splatting — rsasaki0109 · 2026-11-22
- Inside a 26B Looped Transformer: One Vector Swap Lifts 4th-Pass Accuracy from 34% to 74% — pandeyparul · 2026-11-22
- Sandberg: weak concept generation means AI proofs will be long 'elementary' paths — anderssandberg · 2026-11-22
- Will 'compressing vast proofs' become an art? Sandberg thinks it might — anderssandberg · 2026-11-22