| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 1152068 | Statistics & Probability Letters | 2013 | 8 Pages |
Abstract
We prove computable versions of limsuplimsup 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, limsuplimsup is layerwise decidable.
Related Topics
Physical Sciences and Engineering
Mathematics
Statistics and Probability
Authors
George Davie,