Kolmogorov complexity
From Wiktionary, the free dictionary
Remove ads
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 in your browser!
Seamless Wikipedia browsing. On steroids.
Every time you click a link to Wikipedia, Wiktionary or Wikiquote in your browser's search results, it will show the modern Wikiwand interface.
Wikiwand extension is a five stars, simple, with minimum permission required to keep your browsing private, safe and transparent.
Remove ads