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

Kolmogorov Complexity Pictures

Click the following link to bring up a new window with an automated collection of images related to the term: Kolmogorov Complexity Images

Lexicographical Neighbors of Kolmogorov Complexity

Kolarian
Kolarians
Kolhapur
Kolkata
Kolkhis
Kolkwitzia
Kolkwitzia amabilis
Kollam
Kolliker's layer
Kolliker's reticulum
Kollmann's dilator
Kollywood
Kolmer test
Kolmogorov
Kolmogorov complexities
Kolmogorov complexity
Kolmogorov randomness
Kolmogorov space
Koln
Kolomna
Kolonia
Kols
Kolyma
Komboti
Kombotion
Komi
Komis
Kommerell's diverticulum
Komodo
Komodo dragon

Other Resources Relating to: Kolmogorov complexity

Search for Kolmogorov complexity on Dictionary.com!Search for Kolmogorov complexity on Thesaurus.com!Search for Kolmogorov complexity on Google!Search for Kolmogorov complexity on Wikipedia!

Search