Kolmogorov complexity and probability measures

0411048 - UTIA-B 20030035 RIV CZ eng J - Journal Article
Šindelář, Jan - Boček, Pavel
Kolmogorov complexity and probability measures.
Kybernetika. Roč. 38, č. 6 (2002), s. 729-745. ISSN 0023-5954
R&D Projects: GA ČR GA102/99/1564
Institutional research plan: CEZ:AV0Z1075907
Keywords : Kolmogorov complexity * probability measure
Subject RIV: BB - Applied Statistics, Operational Research
Impact factor: 0.341, year: 2002

Classes of strings (infinite sequences resp.) are introduced. Lower bounds of Kolmogorov complexity are prescribed to strings (initial segments of infinite sequences resp.) of specified lengths. Dependence of probabilities of the classes on lower bounds of Kolmogorov complexity is studied. Conditions are found under which the probabilities of the classes of the strings are close to one, probabilities of the classes of sequences equal one. A variant of theorem on infinite oscillations is derived.
Permanent Link: http://hdl.handle.net/11104/0131135