Definitions for kolmogorov complexity
kol·mogorov com·plex·i·ty

WiktionaryRate this definition:0.0 / 0 votes

1. Kolmogorov complexitynoun

   The complexity of an information objectsuch as a book or an imageinformally defined as the length of the shortest program that produces that information object.

WikipediaRate this definition:0.0 / 0 votes

1. Kolmogorov complexity

   In algorithmic information theory (a subfield of computer science and mathematics), the Kolmogorov complexity of an object, such as a piece of text, is the length of a shortest computer program (in a predetermined programming language) that produces the object as output. It is a measure of the computational resources needed to specify the object, and is also known as algorithmic complexity, Solomonoff–Kolmogorov–Chaitin complexity, program-size complexity, descriptive complexity, or algorithmic entropy. It is named after Andrey Kolmogorov, who first published on the subject in 1963 and is a generalization of classical information theory. The notion of Kolmogorov complexity can be used to state and prove impossibility results akin to Cantor's diagonal argument, Gödel's incompleteness theorem, and Turing's halting problem. In particular, no program P computing a lower bound for each text's Kolmogorov complexity can return a value essentially larger than P's own length (see section § Chaitin's incompleteness theorem); hence no single program can compute the exact Kolmogorov complexity for infinitely many texts.

WikidataRate this definition:0.0 / 0 votes

1. Kolmogorov complexity

   In algorithmic information theory, the Kolmogorov complexity of an object, such as a piece of text, is a measure of the computational resources needed to specify the object. It is named after Andrey Kolmogorov, who first published on the subject in 1963. For example, consider the following two strings of length 64, each containing only lowercase letters and digits: The first string has a short English-language description, namely "ab 32 times", which consists of 11 characters. The second one has no obvious simple description other than writing down the string itself, which has 64 characters. More formally, the complexity of a string is the length of the shortest possible description of the string in some fixed universal description language. It can be shown that the Kolmogorov complexity of any string cannot be more than a few bytes larger than the length of the string itself. Strings, like the abab example above, whose Kolmogorov complexity is small relative to the string's size are not considered to be complex.

How to pronounce kolmogorov complexity?

1. Alex

   US English

   David

   US English

   Mark

   US English

   Daniel

   British

   Libby

   British

   Mia

   British

   Karen

   Australian

   Hayley

   Australian

   Natasha

   Australian

   Veena

   Indian

   Priya

   Indian

   Neerja

   Indian

   Zira

   US English

   Oliver

   British

   Wendy

   British

   Fred

   US English

   Tessa

   South African

How to say kolmogorov complexity in sign language?

Numerology

1. Chaldean Numerology

   The numerical value of kolmogorov complexity in Chaldean Numerology is: 8

2. Pythagorean Numerology

   The numerical value of kolmogorov complexity in Pythagorean Numerology is: 6

References

1. ^ Wiktionary
   https://en.wiktionary.org/wiki/Kolmogorov_Complexity
2. ^ Wikipedia
   https://en.wikipedia.org/wiki/Kolmogorov_Complexity
3. ^ Wikidata
   https://www.wikidata.org/w/index.php?search=kolmogorov complexity