English

Noun

Kolmogorov complexity ‎(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