bibtype J - Journal Article
ARLID 0411048
utime 20240903170614.8
mtime 20060210235959.9
title (primary) (eng) Kolmogorov complexity and probability measures
specification
page_count 17 s.
serial
ARLID cav_un_epca*0297163
ISSN 0023-5954
title Kybernetika
volume_id 38
volume 6 (2002)
page_num 729-745
publisher
name Ústav teorie informace a automatizace AV ČR, v. v. i.
keyword Kolmogorov complexity
keyword probability measure
author (primary)
ARLID cav_un_auth*0101205
name1 Šindelář
name2 Jan
institution UTIA-B
fullinstit Ústav teorie informace a automatizace AV ČR, v. v. i.
author
ARLID cav_un_auth*0101069
name1 Boček
name2 Pavel
institution UTIA-B
full_dept Department of Stochastic Informatics
fullinstit Ústav teorie informace a automatizace AV ČR, v. v. i.
COSATI 12B
cas_special
project
project_id GA102/99/1564
agency GA ČR
ARLID cav_un_auth*0004444
research CEZ:AV0Z1075907
abstract (eng) 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.
RIV BB
department SI
permalink http://hdl.handle.net/11104/0131135
ID_orig UTIA-B 20030035
arlyear 2002
mrcbU63 cav_un_epca*0297163 Kybernetika 0023-5954 Roč. 38 č. 6 2002 729 745 Ústav teorie informace a automatizace AV ČR, v. v. i.