acss: Algorithmic Complexity for Short Strings

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 <singmann+acss@gmail.com>
License
GPL (>= 2)
Version
0.2-5
URLs

View on CRAN

Man pages

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.

Files in this package

acss
acss/inst
acss/inst/CITATION
acss/tests
acss/tests/testthat
acss/tests/testthat/test-acss.R
acss/tests/testthat/test-manuscript2014.R
acss/NAMESPACE
acss/NEWS
acss/data
acss/data/matthews2013.rda
acss/data/exp2.rda
acss/data/exp1.rda
acss/R
acss/R/matthews2013-data.R
acss/R/acss.R
acss/R/standard_complexity.R
acss/R/helper.R
acss/R/exp2-data.R
acss/R/exp1-data.R
acss/MD5
acss/DESCRIPTION
acss/man
acss/man/acss.Rd
acss/man/entropy.Rd
acss/man/normalize_string.Rd
acss/man/exp2.Rd
acss/man/matthews2013.Rd
acss/man/exp1.Rd