Computer enumeration as proof aid: Euler squares, sum of powers, four color theorem
moarbugs · x · 2026-11-23
In a discussion about formal proof assistance, moarbugs clarifies his point in its most general form: using computer-based enumeration as a proof aid. He cites three classic examples — settling the Euler squares conjecture (1959), settling Euler's sum of powers conjecture (1966), and proving the four color theorem (1976).
Related event: Computer Enumeration as a Legitimate Tool in Mathematical Proof(2 posts)→
More from Research
- Practitioner observation: agentic traces are more attention-sensitive than monorepo data — SonglinYang4 · 2026-11-23
- Thinking Machines open-sources looped model variant matching mini on coding benchmarks — SonglinYang4 · 2026-11-23
- Rice Lab Turns Fiber-Optic Cable Into 3,123 Underground Mics for Geothermal — DynamicWebPaige · 2026-11-23
- AI Proofs Will Be Extremely Understandable, Argues Viral Thread — Paimaamu · 2026-11-23
- New Haier paper links human intelligence differences to neuronal metabolic efficiency — rjhaier · 2026-11-23
- How computer enumeration became a legitimate proof aid, from 1959 to 1976 — moarbugs · 2026-11-23