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.

Documentation

Manual: acss.pdf
Vignette: None available.

Maintainer: Henrik Singmann <singmann+acss at gmail.com>

Author(s): Nicolas Gauvrit*, Henrik Singmann*, Fernando Soler Toscano*, Hector Zenil*

Install package and any missing dependencies by running this line in your R console:

install.packages("acss")

Depends R (>= 2.15.0), acss.data
Imports zoo
Suggests effects, lattice
Enhances
Linking to
Reverse
depends
Reverse
imports
Reverse
suggests
Reverse
enhances
Reverse
linking to

Package acss
Materials
URL http://complexitycalculator.com/methodology.html
Task Views
Version 0.2-5
Published 2014-11-25
License GPL (>= 2)
BugReports
SystemRequirements
NeedsCompilation no
Citation
CRAN checks acss check results
Package source acss_0.2-5.tar.gz