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.