Kolmogorov complexity

English

Noun

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

complexity defined as the length of the shortest program

• Czech: Kolmogorovova složitost f
• Finnish: Kolmogorov-kompleksisuus
• (deprecated template usage) {{trans-mid}}
• Portuguese: complexidade de Kolmogorov f