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

DOI10.1016/J.SPL.2012.09.010MaRDI QIDQ1933738zbMATH OpenOpenAlexWikidataFDO

Authors George Davie

Publication date 25 January 2013

Published in Statistics \& Probability Letters (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.spl.2012.09.010

zbMATH Keywords

algorithmically random sequencecompressibility coefficienteffective Borel-Cantelli lemmasKolmogorov complexitylayerwise decidable

Mathematics Subject Classification ID

Algorithmic randomness and dimension (03D32) Axioms; other general questions in probability (60A05) Algorithmic information theory (Kolmogorov complexity, etc.) (68Q30)

Recommendations

• The Borel-Cantelli lemmas, probability laws and Kolmogorov complexity
• Limit Theorems for the Maximal Random Sums
• An improved zero-one law for algorithmically random sequences
• Ergodic theorems for individual random sequences
• The Kolmogorov-Loveland stochastic sequences are not closed under selecting subsequences

This page was built for publication: Decidable lim sup and Borel-Cantelli-like lemmas for random sequences

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1933738)