Algorithmic Complexity for Short Strings

Main functionality is to provide the algorithmic complexity for short strings, an approximation of the Kolmogorov Complexity of a short string using the coding theorem method (see ?acss). The database containing the complexity is provided in the data only package, this package provides functions accessing the data such as prob_random returning the posterior probability that a given string was produced by a random process. In addition, two traditional (but problematic) measures of complexity are also provided: entropy and change complexity.


Version 0.2-5 (November 2014)

o added lattice to Suggests as it is not anymore loaded with effects (needed for example of Experiment 2).

Reference manual

It appears you don't have a PDF plugin for this browser. You can click here to download the reference manual.


0.2-5 by Henrik Singmann, 6 years ago

Browse source code at

Authors: Nicolas Gauvrit [aut] , Henrik Singmann [aut, cre] , Fernando Soler Toscano [ctb] , Hector Zenil [ctb]

Documentation:   PDF Manual  

GPL (>= 2) license

Imports zoo

Depends on

Suggests effects, lattice

Suggested by spatialwarnings.

See at CRAN