The Borel-Cantelli lemmas, probability laws and Kolmogorov complexity (Q1872229): Difference between revisions
From MaRDI portal
Added link to MaRDI item. |
Set profile property. |
||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
Revision as of 05:00, 5 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | The Borel-Cantelli lemmas, probability laws and Kolmogorov complexity |
scientific article |
Statements
The Borel-Cantelli lemmas, probability laws and Kolmogorov complexity (English)
0 references
6 May 2003
0 references
Ideas and tools from Kolmogorov complexity [\textit{M. Li} and \textit{P. Vitányi}, ``An introduction to Kolmogorov complexity and its applications'' (1993; Zbl 0805.68063)] are used to formulate effective versions of the Borel-Cantelli lemmas, the strong law of large numbers, and the law of iterated logarithm. The standard formulation of probability theorem ``\(\mathbb P\) holds with probability one'' is replaced by ``\(\mathbb P\) holds for each (Martin-Löf) random infinite sequence'' for effective predicates. Sure, such results give sharper insight into probabilistic phenomena.
0 references
effective Borel-Cantelli lemmas
0 references
probability law
0 references
Martin-Löf random sequence
0 references
Kolmogorov-Chejtin random sequence
0 references
Kolmogorov complexity
0 references
