Kolmogorov Complexity
Version 1.0.0 · Updated 2026-07-30
CORE DEFINITION
The complexity of an object is equal to the shortest length of a computer program that can generate it. If a string of numbers (e.g., 101010...) can be written as "repeat 10 one hundred times" (a short program), it is simple; if a string has no pattern and must be written out in full (the program is as long as the object), it is random/complex.
SCAFFOLDING EFFECT
Reduce cognitive load
Understanding is compression. The essence of 'understanding' is finding a shorter program. Why is the physical formula (E=mc²) beautiful? Because it compresses the energy laws of the entire universe into a few characters. If you cannot summarize a complex phenomenon in a few sentences, you have not yet understood it.
Anchor fast decisions
The descriptive complexity of an object equals the length of the shortest program that generates it; the more random an object, the less compressible it is, and the higher its complexity.
MINIMUM ACTION
In progress 0/2Practice this model in one real situation:
account_treeGenealogyexpand_more
menu_bookReferencesexpand_more
Source support: Explicit
- en.wikipedia.orghttps://en.wikipedia.org/wiki/Kolmogorov_complexityverified
PRIVATE NOTES · Only visible to you
SAVED Q&A
ENTRY Q&A · Private saving available
Ask with a clear boundary
thinkingmodels answers from published entry context only.
Your question is sent to thinkingmodels. The answer uses public entry context only.
RELATED MODELS