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.

Version: 1.0
Depends: R (≥ 2.10)
Published: 2014-04-05
Author: Fernando Soler Toscano [aut], Nicolas Gauvrit [aut], Hector Zenil [aut], Henrik Singmann [aut, cre]
Maintainer: Henrik Singmann <singmann at>
License: GPL-2 | GPL-3 [expanded from: GPL (≥ 2)]
NeedsCompilation: no
Materials: README
CRAN checks: results


Reference manual:
Package source: acss.data_1.0.tar.gz
Windows binaries: r-devel:, r-release:, r-oldrel:
OS X Mavericks binaries: r-release: acss.data_1.0.tgz, r-oldrel: acss.data_1.0.tgz

Reverse dependencies:

Reverse depends: acss


Please use the canonical form to link to this page.