Vovk paper shows probabilistically nonrandom objects have vanishing universal measure
_onionesque · x · 2026-11-22
Vladimir Vovk posted a short arXiv note defining "probabilistically random" objects — algorithmically random elements of finite sets with relatively small Kolmogorov complexity. The main result is a concentration theorem: without assuming any structure, the universal measure of probabilistically nonrandom objects is vanishingly small, and its dependence on the required degree of randomness is established. The poster notes it echoes the "regularity philosophy."
Related event: Vovk's New Paper: Universal Measure of Nonrandom Objects Vanishes(2 posts)→
More from Research
- One photo, 8 VLAs, only 3 correct: ERQA embodied-reasoning benchmark questioned — giffmana · 2026-11-22
- Fleuret: treat AI as oracles, not explainers — human-comprehensible math will be negligible — francoisfleuret · 2026-11-22
- AI generates a Riemann proof, AI generates the rebuttal—and it scores 100% AI — zetalyrae · 2026-11-22
- François Fleuret asks: is the gradient Japanese? It never refuses to give you a direction — francoisfleuret · 2026-11-22
- Hat Matrix Explained: How Much Leverage Does Each Data Point Have in Least Squares? — RobertTLange · 2026-11-22
- DeepMind paper: without direct image viewing, Gemini's defect-spotting falls from 86.7% to 14.3% — nukebuddy · 2026-11-22