On stability of probability laws with respect to small violations of algorithmic randomness

DOI10.1007/s00224-015-9632-6zbMath1339.03033arXiv1409.3865OpenAlexW2113081293MaRDI QIDQ285512

Vladimir V. V'yugin

Publication date: 19 May 2016

Published in: Theory of Computing Systems (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1409.3865

Mathematics Subject Classification ID

Algorithmic information theory (Kolmogorov complexity, etc.) (68Q30) Algorithmic randomness and dimension (03D32)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Randomness on computable probability spaces -- a dynamical point of view
• Two divergence-rate counterexamples
• Upcrossing inequalities for stationary sequences and applications
• Effective symbolic dynamics, random points, statistical behavior, complexity and entropy
• Twice-universal coding
• Ergodic theorems for individual random sequences
• Nonrobustness property of the individual ergodic theorem
• Computability of probability measures and Martin-Löf randomness over metric spaces
• Problems of robustness for universal coding schemes
• Randomness and Non-ergodic Systems
• Local stability of ergodic averages
• The Law of the Iterated Logarithm for Random Kolmogorov, or Chaotic, Sequences
• Эффективная сходимость по вероятности и эргодическая теорема для индивидуальных случайных последовательностей
• Cutting and stacking: a method for constructing stationary processes
• Schnorr randomness
• Probability Inequalities for Sums of Bounded Random Variables
• Reconciling Data Compression and Kolmogorov Complexity
• A unified approach to the definition of random sequences