On extremal relations between additive loss functions and the Kolmogorov complexity

V. V. V'yugin, V. P. Maslov

Research output: Contribution to journalArticlepeer-review

6 Citations (Scopus)

Abstract

The maximum achievement conditions are studied for Kolmogorov complexity (algorithmic entropy) of a finite letters sequence of some alphabet in a given message cost. Possible extremum relations are considered between the message cost and the Kolmogorov complexity. In particular, a problem is considered on minimization of some value depending on the difference between these two values with some parameter called as temperature accordingly the thermodynamics.

Original languageEnglish
Pages (from-to)71-87
Number of pages17
JournalProblemy Peredachi Informatsii
Volume39
Issue number4
Publication statusPublished - 2003
Externally publishedYes

Fingerprint

Dive into the research topics of 'On extremal relations between additive loss functions and the Kolmogorov complexity'. Together they form a unique fingerprint.

Cite this