Kolmogorov complexity and strong approximation of Brownian motion

DOI10.1090/S0002-9939-2011-10741-XzbMath1244.68043arXiv1408.2278MaRDI QIDQ3092856

Bjørn Kjos-Hanssen, Tamas Szabados

Publication date: 11 October 2011

Published in: Proceedings of the American Mathematical Society (Search for Journal in Brave)

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

Mathematics Subject Classification ID

Strong limit theorems (60F15) Algorithmic information theory (Kolmogorov complexity, etc.) (68Q30) Algorithmic randomness and dimension (03D32)

Related Items (6)

Randomness, Computation and Mathematics ⋮ On zeros of Martin-Löf random Brownian motion ⋮ The descriptive complexity of stochastic integration ⋮ On the computability of a construction of Brownian motion ⋮ Kolmogorov complexity and the geometry of Brownian motion ⋮ Polynomial time relatively computable triangular arrays for almost sure convergence

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Moderate and small deviations for the ranges of one-dimensional random walks
• Effective dimension of points visited by Brownian motion
• The descriptive complexity of Brownian motion
• Stochastic bifurcation models
• Zufälligkeit und Wahrscheinlichkeit. Eine algorithmische Begründung der Wahrscheinlichkeitstheorie. (Randomness and probability. An algorithmic foundation of probability theory)
• Exact Expressions for Some Randomness Tests
• An approximation of partial sums of independent RV's, and the sample DF. II
• An approximation of partial sums of independent RV'-s, and the sample DF. I
• A Theory of Program Size Formally Identical to Information Theory
• Arithmetical representations of Brownian motion I
• An introduction to Kolmogorov complexity and its applications

This page was built for publication: Kolmogorov complexity and strong approximation of Brownian motion