We consider the Maximum Entropy principle for non-ordered data in a non-probabilistic setting. The main goal of this paper is to deduce asymptotic relations for the frequencies of the energy levels in a non-ordered sequence ωN = [ω1,. . . , ωN] from the assumption of maximality of the Kolmogorov complexity K(ωN) given a constraint Σi=1N f(ωi) = NE, where E is a number and f is a numerical function.
|Number of pages||13|
|Journal||Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)|
|Publication status||Published - 2004|
|Event||15th International Conference ALT 2004: Algorithmic Learning Theory - Padova, Italy|
Duration: 2 Oct 2004 → 5 Oct 2004