Main Page | About | Team | R Package | Methodology | Publications | Download Data and Tools

The Online Algorithmic Complexity Calculator

Short String Complexity Explorer

version 0.2 (Beta)

 

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.

 

Content on this site is licensed under a
Creative Commons Attribution 3.0 License

Creative Commons Licence Attribution 3.0 Unported (CC BY 3.0)
View License Deed | View Legal Code
Contact info: hectorz at LABORES dot EU
Cite as follows:
Soler-Toscano F, Zenil H, Delahaye J-P, Gauvrit N (2014) Calculating Kolmogorov Complexity from the Output Frequency Distributions of Small Turing Machines. PLoS ONE 9(5): e96223. doi:10.1371/journal.pone.0096223
Algorithmic Nature Group - LABORES
Celebrating the Alan Turing Year