Kolmogorov complexity

Definition from Wiktionary, the free dictionary
Jump to: navigation, search

English[edit]

Noun[edit]

Kolmogorov complexity (countable and uncountable, plural Kolmogorov complexities)

  1. (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.

Translations[edit]