Kolmogorov complexity

English

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.

Translations

complexity defined as the length of the shortest program

Czech: Kolmogorovova složitost f
Finnish: Kolmogorov-kompleksisuus

Portuguese: complexidade de Kolmogorov f

This article is issued from Wiktionary. The text is licensed under Creative Commons - Attribution - Sharealike. Additional terms may apply for the media files.