The Borel–Cantelli Lemmas, Probability Laws and Kolmogorov Complexity
George Elder Davie · The Annals of Probability · 2001
We formulate effective versions of the Borel–Cantelli lemmas using a coefficient from Kolmogorov complexity. We then use these effective versions to lift the effective content of the law of large numbers and the law of the iterated logarithm.