Definitions from Wiktionary (Kolmogorov complexity)
▸ noun: (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 as output.
▸ Words similar to Kolmogorov complexity
▸ Usage examples for Kolmogorov complexity
▸ Idioms related to Kolmogorov complexity
▸ Wikipedia articles (New!)
▸ Words that often appear near Kolmogorov complexity
▸ Rhymes of Kolmogorov complexity
▸ Invented words related to Kolmogorov complexity
▸ noun: (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 as output.
Similar:
algorithmic entropy,
complexity function,
Kolmogorov space,
time complexity,
space complexity,
complexity class,
McCabe's complexity,
cyclomatic complexity,
Kolmogorov-Arnold-Moser theorem,
Rademacher complexity,
more...
▸ Words similar to Kolmogorov complexity
▸ Usage examples for Kolmogorov complexity
▸ Idioms related to Kolmogorov complexity
▸ Wikipedia articles (New!)
▸ Words that often appear near Kolmogorov complexity
▸ Rhymes of Kolmogorov complexity
▸ Invented words related to Kolmogorov complexity