Asymptotic calibration possible for decidable statements, but not Pi_n generally
xuanalogue · x · 2026-10-28
In a thread tied to the recent claimed ETH refutations, xuanalogue explains that asymptotic calibration is possible for decidable statements but not for Pin statements in general, since you can't operationalize bets on mathematical claims that must pay out in finite time. ETH and P=NP themselves may not be decidable, but one can ask decidable variants like whether a proof under n bytes exists—though deciding that could take extremely long depending on P vs NP.
More from Research
- Proposal: a public challenge to find the shortest prompt reproducing each arXiv paper's results — tak3sh8 · 2026-10-28
- RAX lets a real robot explore for 2 hours and turn learned skills into reusable code — no demos needed — du_yilun · 2026-10-28
- Three approaches to using one model to help build another that makes decisions — TheTuringPost · 2026-10-28
- ML models predict lifespan-extending compounds with up to 80.36% accuracy — Dr_Singularity · 2026-10-28
- MQAScore: fine-grained text-music alignment eval across 5 dimensions via LALM — affige_yang · 2026-10-28
- OpenTac tactile sensors demoed at CoRL 2026 among 17 robot demos — _krishna_murthy · 2026-10-28