Sequence type
Custom sequence (0/1):
Length n:--
LZ76 complexity:--
Compression ratio:--
Shannon entropy H:--
Run-length bits:--
Approx K(x)/n:--
Type:--
Algorithmic information — compression, randomness, and structure
K(x) = length of shortest program producing x. Incomputable (halting problem). LZ76 approximates K(x). Random strings are incompressible: K(x) approx |x|. Structured strings compressible: K(x) much less than |x|. Berry paradox: the smallest integer not definable in fewer than thirteen words.