Mathematician argues conjectures falsifiable by direct computation deserve more interest than metrics suggest
BlancheMinerva · x · 2026-11-11
Blanche Minerva explains that claim #2 in first-order logic requires infinitely many statements, jointly satisfiable iff every finite subset is — each finite subset asserts the same thing about a large finite field, where it trivially holds. She also argues that any interesting conjecture falsifiable by direct computation is likely more interesting than the metric implies.
Related event: Google's AI math explanations debunked point by point by mathematician(2 posts)→
More from Research
- New grokking study: generalization emerges from spontaneous structural collapse and compression — burny_tech · 2026-11-11
- TRIAD benchmark: no multimodal retrieval system leads across its six subsets — _reachsumit · 2026-11-11
- Vision tokens far denser than text: paper traces VLM modality gap to early-layer processing — _reachsumit · 2026-11-11
- ByteDance's SepLRM splits recommendation models around a shared KV cache — _reachsumit · 2026-11-11
- Yuanbao-Reranker: 0.6B/4B/8B Qwen3-based rerankers trained on synthetic preferences, open-sourced — _reachsumit · 2026-11-11
- Shopify's RoutingTrie lifts generative retrieval Hit@100 from 67.5% to 96.1% with 1.1ms overhead — _reachsumit · 2026-11-11