pith. machine review for the scientific record. sign in
def definition def or abbrev

kolmogorovComplexity

show as:
view Lean formalization →

No prose has been written for this declaration yet. The Lean source and graph data below render without it.

generate prose now

formal statement (Lean)

 162def kolmogorovComplexity : String :=

proof body

Definition body.

 163  "Shortest program length to output x"
 164
 165/-- Incompressibility:
 166
 167    Most strings are incompressible!
 168
 169    For strings of length n:
 170    - At most 2^(n-1) can compress to n-1 bits
 171    - Most strings have K(x) ≈ n
 172
 173    Random = incompressible = maximum J-cost-to-entropy ratio -/

depends on (12)

Lean names referenced from this declaration's body.