concepts → Quantity
Kolmogorov complexity
also called algorithmic complexity
the true length of the shortest description of a thing — and it cannot be computed
Where it sits
The prism has six jobs across and eight layers down. Its primary cell is measure × L0. Hatched cells cannot exist — a GPU does not learn, an institution does not infer.
What must come first — and what it unlocks
Left to right is reading order, derived from the prerequisite_of edges. Nothing here is hand-ordered: the diagram is the graph.
Where to read it
The chapter that introduces it, and any chapter that uses it again.
Where it comes from
Every connection
All 3 edges touching this node, grouped by relation family — the sections above are highlights from this list. Colours match the relation families inthe atlas.
This page is a projection of one node in src/data/concepts.ts. It has no prose file of its own — 521 declared edges produce all 340 of these pages. Edit an edge and both endpoints change.