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)→

Original post →

More from Research

Research channel →