TY - JOUR

T1 - On Stability of Probability Laws with Respect to Small Violations of Algorithmic Randomness

AU - V’yugin, Vladimir V.

PY - 2016/4/1

Y1 - 2016/4/1

N2 - We study a stability property of probability laws with respect to small violations of algorithmic randomness. Some sufficient condition of stability is presented in terms of Schnorr tests of algorithmic randomness. Most probability laws, like the strong law of large numbers, the law of iterated logarithm, and even Birkhoff’s pointwise ergodic theorem for ergodic transformations, are stable in this sense. Nevertheless, the phenomenon of instability occurs in ergodic theory. Firstly, the stability property of Birkhoff’s ergodic theorem is non-uniform. Moreover, a computable non-ergodic measure-preserving transformation can be constructed such that the ergodic theorem is non-stable.

AB - We study a stability property of probability laws with respect to small violations of algorithmic randomness. Some sufficient condition of stability is presented in terms of Schnorr tests of algorithmic randomness. Most probability laws, like the strong law of large numbers, the law of iterated logarithm, and even Birkhoff’s pointwise ergodic theorem for ergodic transformations, are stable in this sense. Nevertheless, the phenomenon of instability occurs in ergodic theory. Firstly, the stability property of Birkhoff’s ergodic theorem is non-uniform. Moreover, a computable non-ergodic measure-preserving transformation can be constructed such that the ergodic theorem is non-stable.

UR - http://www.scopus.com/inward/record.url?scp=84960459890&partnerID=8YFLogxK

U2 - 10.1007/s00224-015-9632-6

DO - 10.1007/s00224-015-9632-6

M3 - Article

AN - SCOPUS:84960459890

VL - 58

SP - 403

EP - 423

JO - Theory of Computing Systems

JF - Theory of Computing Systems

SN - 1432-4350

IS - 3

ER -