Kolmogorov complexity
From Wiktionary, the free dictionary
English
Noun
Kolmogorov complexity (countable and uncountable, plural Kolmogorov complexities)
- (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 as output.
Translations
complexity defined as the length of the shortest program
|
Wikiwand - on
Seamless Wikipedia browsing. On steroids.