| Abstract: | Conditions are presented under which the maximum of the Kolmogorov complexity (algorithmic entropy) K( 1...
N
) is attained, given the cost
f(
i
) of a message 1...
N
. Various extremal relations between the message cost and the Kolmogorov complexity are also considered; in particular, the minimization problem for the function
f(
i
) –  K(1...
N
) is studied. Here, is a parameter, called the temperature by analogy with thermodynamics. We also study domains of small variation of this function. |
