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.

AuthorNicolas Gauvrit [aut], Henrik Singmann [aut, cre], Fernando Soler Toscano [ctb], Hector Zenil [ctb]
Date of publication2014-11-25 08:45:18
MaintainerHenrik Singmann <singmann+acss@gmail.com>
LicenseGPL (>= 2)
Version0.2-5
http://complexitycalculator.com/methodology.html

View on CRAN

Files

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

Questions? Problems? Suggestions? or email at ian@mutexlabs.com.

Please suggest features or report bugs with the GitHub issue tracker.

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