Kolmogorov complexity
E183589
UNEXPLORED
Kolmogorov complexity is a measure of the amount of information in an object, defined as the length of the shortest computer program that can produce it.
Aliases (2)
Referenced by (6)
| Subject (surface form when different) | Predicate |
|---|---|
|
Andrei Kolmogorov
("algorithmic randomness")
→
Andrei Kolmogorov → |
notableIdea |
|
Berry paradox
→
Berry paradox ("Chaitin’s incompleteness theorem") → |
relatedTo |
|
Andrei Kolmogorov
→
|
notableWork |
|
Occam's razor
→
|
relatedConcept |