Main functionality is to provide the algorithmic complexity for short strings, an approximation of the Kolmogorov Complexity of a short string using the coding theorem method (see ?acss). The database containing the complexity is provided in the data only package acss.data, this package provides functions accessing the data such as prob_random returning the posterior probability that a given string was produced by a random process. In addition, two traditional (but problematic) measures of complexity are also provided: entropy and change complexity.
|Author||Nicolas Gauvrit [aut], Henrik Singmann [aut, cre], Fernando Soler Toscano [ctb], Hector Zenil [ctb]|
|Date of publication||2014-11-25 08:45:18|
|Maintainer||Henrik Singmann <firstname.lastname@example.org>|
|License||GPL (>= 2)|
acss: ACSS complexity
entropy: Standard measures of complexity for strings
exp1: Data from Experiment 1 in Gauvrit, Singmann, Soler-Toscano &...
exp2: Data from Experiment 2 in Gauvrit, Singmann, Soler-Toscano &...
matthews2013: Data from Experiment 1 in Matthews (2013)
normalize_string: Helper functions for calculating cognitive complexity.