acss.data: 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 gmail.com>
License:	GPL-2 | GPL-3 [expanded from: GPL (≥ 2)]
URL:	http://complexitycalculator.com/methodology.html
NeedsCompilation:	no
Materials:	README
CRAN checks:	acss.data results

Documentation:

Reference manual:

acss.data.pdf

Downloads:

Package source:	acss.data_1.0.tar.gz
Windows binaries:	r-devel: acss.data_1.0.zip, r-release: acss.data_1.0.zip, r-oldrel: acss.data_1.0.zip
macOS binaries:	r-release (arm64): acss.data_1.0.tgz, r-oldrel (arm64): acss.data_1.0.tgz, r-release (x86_64): acss.data_1.0.tgz, r-oldrel (x86_64): acss.data_1.0.tgz

Reverse dependencies:

Reverse depends:

acss

Linking:

Please use the canonical form https://CRAN.R-project.org/package=acss.data to link to this page.