0411048 20240903170614.820060210235959.9 17 s. cav_un_epca*02971630023-5954386 (2002)729-745Ústav teorie informace a automatizace AV ČR, v. v. i. Kolmogorov complexity probability measure cav_un_auth*0101205 Šindelář Jan UTIA-B Ústav teorie informace a automatizace AV ČR, v. v. i. cav_un_auth*0101069 Boček Pavel UTIA-B Department of Stochastic Informatics Ústav teorie informace a automatizace AV ČR, v. v. i. 12B GA102/99/1564 GA ČR cav_un_auth*0004444 CEZ:AV0Z1075907 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. BB SI http://hdl.handle.net/11104/0131135 UTIA-B 20030035 2002 cav_un_epca*0297163 Kybernetika 0023-5954 Roč. 38 č. 6 2002 729 745 Ústav teorie informace a automatizace AV ČR, v. v. i.