Decidable lim sup and Borel-Cantelli-like lemmas for random sequences

作者：Davie George^*

来源：Statistics & Probability Letters, 2013, 83(1): 278-285.

DOI：10.1016/j.spl.2012.09.010

• Algorithmically random sequence
• Layerwise decidable
• Effective Borel-Cantelli lemmas
• Kolmogorov complexity
• Compressibility coefficient

We prove computable versions of lim sup events and Borel Cantelli-like results for algorithmically random sequences using a coefficient from Kolmogorov complexity. In particular we show that under suitable conditions on events, lim sup is layerwise decidable.

• 出版日期2013-1