The Online Algorithmic Complexity
Calculator (OACC) is an on-going long-term project of the Algorithmic Nature Group to develop an online tool implementing semi-computable measures of complexity
through various numerical methods and algorithms for potential applications
in a very wide range of disciplines, from bioinformatics to psychometrics,
from linguistics to economics.
It currently retrieves numerical
approximations (upper bounds) of Kolmogorov complexity for binary strings
of short length by means of algorithmic probability (notably by using the
algorithmic Coding Theorem relating frequency and complexity), for string
length which lossless compression algorithms fail to deal with, hence providing
an alternative/complementary method to compression algorithms (in the future
the calculator will smoothly make the transition between the algorithmic
probability and the lossless compression methods using a technique that
the group has developed called the Block Decomposition Method.
More algorithmic information measures,
more data, and more techniques will be incorporated gradually in the future,
covering a wider range of applications such as images and n-dimensional objects.
Full code for the Complexity Calculator, data, and tools such
as the acss R package and a Mathematica notebook with our methods are available for download.