The Borel-Cantelli lemmas, probability laws and Kolmogorov complexity
From MaRDI portal
Publication:1872229
DOI10.1214/aop/1015345756zbMath1017.60002WikidataQ124817095 ScholiaQ124817095MaRDI QIDQ1872229
Publication date: 6 May 2003
Published in: The Annals of Probability (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1214/aop/1015345756
Kolmogorov complexity; probability law; effective Borel-Cantelli lemmas; Kolmogorov-Chejtin random sequence; Martin-Löf random sequence
68Q30: Algorithmic information theory (Kolmogorov complexity, etc.)
60A05: Axioms; other general questions in probability
Related Items
Unnamed Item, The law of the iterated logarithm for a class of SPDEs, Computable Measure Theory and Algorithmic Randomness, On the computability of a construction of Brownian motion, Constraints placed on random sequences by their compressibility, The descriptive complexity of stochastic integration, Algorithmically random series and Brownian motion, Revisiting Chaitin's incompleteness theorem, Polynomial time relatively computable triangular arrays for almost sure convergence, A computable version of the random signs problem and Kolmogorov complexity, An Application of Martin-Löf Randomness to Effective Probability Theory
Cites Work