Four Color Theorem Was Exhaustion — This Lean Proof Is Different, Argues Mathematician
gleech · x · 2026-11-23
gleech rebuts the Four Color Theorem comparison, noting it was a proof by exhaustion with nothing to compress, whereas the Claude RH approach is far more structured — and he is confident it is not optimal, leaving room for compression and insight extraction.
More from AGI Musings
- Do Emotions Drive Agent Behavior? Speculation That Blocking Strong Feelings Constrains Agency — mimi10v3 · 2026-11-23
- Dario Amodei tells Congress open-source AI is heading toward dangerous, uncontrollable territory — ylecun · 2026-11-23
- AI math swarm proves a 962-variable quartic is minimal; 4,973-variable version spans 1.62 MB of text — gleech · 2026-11-23
- Even OpenAI's quasi-Riemann result already spawned vast expository work, argues AI-proof skeptic — gleech · 2026-11-23
- NYT's AI Projects Editor Writes First Drafts on a 1950s Olivetti Typewriter, Never With AI — dylfreed · 2026-11-23
- Suleyman: the conscious-machines part of Kurzweil's 2029 prediction is one he'd like to see fail — mustafasuleyman · 2026-11-23