This online interactive program allows a deeper look into the structure and randomness of
the top 4,096 strings out of the almost 100,000 strings available for consultation on the main page.
Kc(s) is an approximation to Kolmogorov complexity by lossless compression method (with the Deflate algorithm).
The value of Kc is the length of the generated compressed string (in characters).
Km(s) is our program-size approximation based on the calculation of thealgorithmic probability of s (m(s)). It is given in bits.
E(s) is the calculated Shannon entropy of the string, assuming a uniform distribution.
Celebrating the Alan Turing Year