CRAN 1.0

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

Released Apr 5, 2014 by Fernando Soler Toscano [aut], Nicolas Gauvrit [aut], Hector Zenil [aut], Henrik Singmann [aut, cre]

This package can be loaded by Renjin but no tests could be found for the package.

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.



This package can be included as a dependency from a Java or Scala project by including the following your project's pom.xml file. Read more about embedding Renjin in JVM-based projects.

    <name>bedatadriven public repo</name>

View build log

Renjin CLI

If you're using Renjin from the command line, you load this library by invoking:



View GitHub Mirror

Release History