R Shiny code for the Online Algorithmic Complexity Calculator version 3.0 by the Algorithmic Nature Group and the Algorithmic Dynamics Lab.
To run this app locally, download R Studio and follow the instructions here.
Our Block Decomposition Method to estimate Kolmogorov complexity in strings and graphs of arbitrary size is described in A Divide-and-Conquer Method for Local Estimations of Algorithmic Complexity Lower Bounded by Shannon Entropy by H. Zenil, F. Soler-Toscano, N.A. Kiani, S. Hernández-Orozco, and A. Rueda-Toicen.
The Coding Theorem Method and the Block Decomposition Method are also described in Calculating Kolmogorov Complexity from the Output Frequency Distributions of Small Turing Machines by F. Soler-Toscano, H. Zenil, J.-P. Delahaye and N. Gauvrit.
If you make use of results from this calculator, please make sure to visit How To Cite.
This app uses the acss package available at CRAN and maintained by Henrik Singmann.