|
|
Definition of Kolmogorov complexity
1. Noun. (computing theory) The complexity of an information object—such as a book or an image—informally defined as the length of the shortest program that produces that information object. ¹
¹ Source: wiktionary.com
Lexicographical Neighbors of Kolmogorov Complexity
Other Resources:
