algorithmic entropy
名词 n.
英文释义
名词 n.
-
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.
0 次浏览
数据来源: Wiktionary