Machine-assisted search finds a counterexample to a 87-year-old conjecture
MoonL88537 · x · 2026-07-20
The post highlights a math result discovered with machine-assisted search and argues it may signal a broader shift in how difficult problems are found, even if it is not a full paradigm change.
From the quoted discussion:
- An 87-year-old conjecture appears to have been disproved by a compact counterexample in three variables.
- The discovery process seems to have involved a workflow of semantic generator → structured candidate → exact verifier → revision.
- The key point is not blind hillclimbing, but using a learned proposal distribution plus a perfect verifier to search a huge space efficiently.
The author’s take is that models may not need to become omniscient theorem provers. They may only need to generate high-value, machine-checkable candidates from enormous search spaces, where generation is hard but verification is cheap.
More from Research
- Navier-Stokes, Riemann, P vs NP: what this week's math buzzwords mean for you — koltregaskes · 2026-09-11
- Fruit fly connectome LLM weights land on Hugging Face, transformers-compatible — ngxson · 2026-09-11
- Fruit fly brain as an LLM: connectome-driven language model demo goes live — ngxson · 2026-09-11
- Harry Collins: LLMs can't do frontier science because they can't invent new language — whoamisri · 2026-09-11
- The Waymo effect: how AI is quietly making research less collaborative — JohnHammersley · 2026-09-11
- Causal-only attention for non-generative tasks is wasteful, argues HF engineer — antoine_chaffin · 2026-09-11