|
gptkbp:instanceOf
|
gptkb:mathematical_concept
|
|
gptkbp:alsoKnownAs
|
algorithmic complexity
descriptional complexity
|
|
gptkbp:appliesTo
|
finite strings
|
|
gptkbp:category
|
gptkb:information_theory
gptkb:mathematics
theoretical computer science
|
|
gptkbp:defines
|
length of the shortest binary program that outputs a given string
|
|
gptkbp:dependsOn
|
choice of universal Turing machine
|
|
gptkbp:differenceBetweenMachines
|
bounded by a constant
|
|
gptkbp:field
|
algorithmic information theory
|
|
gptkbp:formedBy
|
gptkb:Andrey_Kolmogorov
gptkb:Gregory_Chaitin
gptkb:Ray_Solomonoff
|
|
https://www.w3.org/2000/01/rdf-schema#label
|
Kolmogorov complexity
|
|
gptkbp:introducedIn
|
1960s
|
|
gptkbp:measures
|
bits
|
|
gptkbp:namedAfter
|
gptkb:Andrey_Kolmogorov
|
|
gptkbp:relatedConcept
|
plain Kolmogorov complexity
prefix Kolmogorov complexity
|
|
gptkbp:relatedTo
|
gptkb:Chaitin's_constant
gptkb:Solomonoff's_theory_of_inductive_inference
algorithmic randomness
incompressibility
|
|
gptkbp:uncomputable
|
true
|
|
gptkbp:usedIn
|
gptkb:information_theory
data compression
theoretical computer science
randomness testing
|
|
gptkbp:bfsParent
|
gptkb:information_theory
gptkb:Algorithms_and_Complexity
|
|
gptkbp:bfsLayer
|
4
|