English Dictionary

algorithmic entropy

noun

Kolmogorov complexity

Algorithmic entropy is a measure of the complexity of a string based on the length of the shortest algorithm that can generate it.

意味（1）

Kolmogorov complexity

Algorithmic entropy is closely related to statistically defined entropy, the statistical entropy of an ensemble being, for any concisely describable ensemble, very nearly equal to the ensemble average of the algorithmic entropy of its members; but for this reason algorithmic entropy corresponds intuitively to randomness rather than to complexity.