The Law of the Iterated Logarithm for Random Kolmogorov, or Chaotic, Sequences
From MaRDI portal
Publication:3788795
DOI10.1137/1132061zbMath0645.60006OpenAlexW2021889628MaRDI QIDQ3788795
Publication date: 1987
Published in: Theory of Probability & Its Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1137/1132061
law of the iterated logarithmalgorithm theory of informationrandomness propertystability of relative deviations from randomnesses
Related Items (21)
The Borel-Cantelli lemmas, probability laws and Kolmogorov complexity ⋮ On stability of probability laws with respect to small violations of algorithmic randomness ⋮ Computability of convergence rates in the ergodic theorem for Martin-Löf random points ⋮ Algorithmic complexity of points in dynamical systems ⋮ Unnamed Item ⋮ Statistical properties of finite sequences with high Kolmogorov complexity ⋮ Did Jean Ville Invent Martingales? ⋮ Ergodic theorems and converses for PSPACE functions ⋮ Merging of opinions in game-theoretic probability ⋮ On the stability property of asymptotic laws of ergodic theory and universal compression schemes ⋮ Test martingales, Bayes factors and \(p\)-values ⋮ Constraints placed on random sequences by their compressibility ⋮ Capital Process and Optimality Properties of a Bayesian Skeptic in Coin-Tossing Games ⋮ Dynamics of a generic Brownian motion: Recursive aspects ⋮ Algorithmic randomness over general spaces ⋮ Ergodic theorems for individual random sequences ⋮ Martin-Löf randomness implies multiple recurrence in effectively closed sets ⋮ Modeling parallel transport ⋮ Unnamed Item ⋮ Computable Measure Theory and Algorithmic Randomness ⋮ Identifying randomness given by high descriptive complexity
This page was built for publication: The Law of the Iterated Logarithm for Random Kolmogorov, or Chaotic, Sequences
