Kolmogorov complexity and probability measures.

Result code in IS VaVaI

<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F67985556%3A_____%2F02%3A16030035" target="_blank" >RIV/67985556:_____/02:16030035 - isvavai.cz</a>

Result on the web

—

DOI - Digital Object Identifier

—

Result language

angličtina

Original language name

Kolmogorov complexity and probability measures.

Original language description

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 boundsof 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.

Czech name

—

Czech description

—

Type

J_x - Unclassified - Peer-reviewed scientific article (Jimp, Jsc and Jost)

CEP classification

BB - Applied statistics, operational research

OECD FORD branch

—

Project

<a href="/en/project/GA102%2F99%2F1564" target="_blank" >GA102/99/1564: Research and education centre in adaptive systems - A pilot project</a><br>

Continuities

P - Projekt vyzkumu a vyvoje financovany z verejnych zdroju (s odkazem do CEP)<br>Z - Vyzkumny zamer (s odkazem do CEZ)

Publication year

2002

Confidentiality

S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů

Name of the periodical

Kybernetika

ISSN

0023-5954

e-ISSN

—

Volume of the periodical

38

Issue of the periodical within the volume

6

Country of publishing house

CZ - CZECH REPUBLIC

Number of pages

17

Pages from-to

729-745

UT code for WoS article

—

EID of the result in the Scopus database

—