Decidable lim sup and Borel–Cantelli-like lemmas for random sequences (original) (raw)

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

Statistics & Probability Letters, 2013

Abstract

We prove computable versions of limsup 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, limsup is layerwise decidable.

George Davie hasn't uploaded this paper.

Create a free Academia account to let George know you want this paper to be uploaded.

Ask for this paper to be uploaded.