Universal Measures of Complexity - Algorithmic Nature Group http://complexitycalculator.com/
Channel: Hector Zenil
Date: 2016-09-06

Computing the uncomputable: numerical approximations to non-computable measures of complexity. All rights reserved Hector Zenil.

Universal Measures of Complexity - Algorithmic Nature Group http://complexity-calculator.com/

Relevant literature:

An online implementation of the methods is available at The Online Algorithmic Complexity Calculator:

http://complexitycalculator.com/

And the relevant papers on which all this is based are:

Delahaye J-P and Zenil, H (2012) Numerical Evaluation of the Complexity of Short Strings: A Glance Into the Innermost Structure of Algorithmic Randomness
Applied Mathematics and Computation 219, pp. 63-77.

Soler-Toscano F, Zenil H, Delahaye J-P and Gauvrit N (2014) Calculating Kolmogorov Complexity from the Output Frequency Distributions of Small Turing Machines. PLoS ONE 9(5): e96223.

Zenil H, Soler-Toscano F, Dingle K and Louis A (2014) Correlation of Automorphism Group Size and Topological Properties with Program-size Complexity Evaluations of Graphs and Complex Networks, Physica A: Statistical Mechanics and its Applications, vol. 404, pp. 341–358, 2014.

Zenil H, Soler-Toscano F, Kiani N.A., Hernández-Orozco S, Rueda-Toicen A (2016) A Decomposition Method for Global Evaluation of Shannon Entropy and Local Estimations of Algorithmic Complexity, arXiv:1609.00110