Kolmogorov complexity

From Wiktionary, the free dictionary
Archived revision by Surjection (talk | contribs) as of 20:47, 29 April 2018.
Jump to navigation Jump to search

English

English Wikipedia has an article on:
Wikipedia

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