Data Only: Algorithmic Complexity of Short Strings (Computed via Coding Theorem Method)

Data only package providing the algorithmic complexity of short strings, computed using the coding theorem method. For a given set of symbols in a string, all possible or a large number of random samples of Turing machines (TM) with a given number of states (e.g., 5) and number of symbols corresponding to the number of symbols in the strings were simulated until they reached a halting state or failed to end. This package contains data on 4.5 million strings from length 1 to 12 simulated on TMs with 2, 4, 5, 6, and 9 symbols. The complexity of the string corresponds to the distribution of the halting states of the TMs.

  • From CRAN: In the future

  • Development version from Github:

library("devtools"); install_github("acss_data",user="singmann")


Reference manual

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


1.0 by Henrik Singmann, 5 years ago

Browse source code at

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

Documentation:   PDF Manual  

GPL (>= 2) license

Depended on by acss.

See at CRAN