Kolmogorov complexity
Jump to navigation
Jump to search
English[edit]
Noun[edit]
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[edit]
complexity defined as the length of the shortest program
|