Approximate K(x) via LZ77 compression — random strings are hard to compress; structured strings compress well
Input String
Presets:
All zeros
01 repeat
Fibonacci word
Thue-Morse
Digits of π
Random bits
English text
DNA sequence
Complexity Metrics
Compression ratio (shorter = simpler = lower K):
Character visualization — dark=0, bright=1/A (color=character class)
Compare Multiple Strings
K estimate vs string length for different string types