bn:00872283n
Noun Concept
Categories: Articles with short description, Information theory, Computability theory, Algorithmic information theory, Descriptive complexity
EN
Kolmogorov complexity  algorithmic complexity theory  algorithmic entropy  Chaitin's incompleteness theorem  Chaitin-Kolmogorov randomness
EN
In algorithmic information theory, the Kolmogorov complexity of an object, such as a piece of text, is the length of a shortest computer program that produces the object as output. Wikipedia
Definitions
Relations
Sources
EN
In algorithmic information theory, the Kolmogorov complexity of an object, such as a piece of text, is the length of a shortest computer program that produces the object as output. Wikipedia
A measure of algorithmic complexity Wikipedia Disambiguation
measure of algorithmic complexity Wikidata
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. Wiktionary
Complexity defined as the length of the shortest program. Wiktionary (translation)