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.

Author | Fernando Soler Toscano [aut], Nicolas Gauvrit [aut], Hector Zenil [aut], Henrik Singmann [aut, cre] |

Date of publication | 2014-04-05 18:54:45 |

Maintainer | Henrik Singmann <singmann@gmail.com> |

License | GPL (>= 2) |

Version | 1.0 |

http://complexitycalculator.com/methodology.html |

acss.data

acss.data/NAMESPACE

acss.data/R

acss.data/R/sysdata.rda

acss.data/README.md

acss.data/MD5

acss.data/DESCRIPTION

acss.data/man

acss.data/man/acss_data-package.Rd
acss.data/man/acss_data.Rd
Questions? Problems? Suggestions? Tweet to @rdrrHQ or email at ian@mutexlabs.com.

All documentation is copyright its authors; we didn't write any of that.