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.
| Version: | 0.2-5 |
| Depends: | R (≥ 2.15.0), acss.data |
| Imports: | zoo |
| Suggests: | effects, lattice |
| Published: | 2014-11-25 |
| DOI: | 10.32614/CRAN.package.acss |
| Author: | Nicolas Gauvrit [aut], Henrik Singmann [aut, cre], Fernando Soler Toscano [ctb], Hector Zenil [ctb] |
| Maintainer: | Henrik Singmann <singmann+acss at gmail.com> |
| License: | GPL-2 | GPL-3 [expanded from: GPL (≥ 2)] |
| URL: | http://complexitycalculator.com/methodology.html |
| NeedsCompilation: | no |
| Citation: | acss citation info |
| Materials: | NEWS |
| CRAN checks: | acss results |
| Reference manual: | acss.pdf |
| Package source: | acss_0.2-5.tar.gz |
| Windows binaries: | r-devel: acss_0.2-5.zip, r-release: acss_0.2-5.zip, r-oldrel: acss_0.2-5.zip |
| macOS binaries: | r-release (arm64): acss_0.2-5.tgz, r-oldrel (arm64): acss_0.2-5.tgz, r-release (x86_64): acss_0.2-5.tgz, r-oldrel (x86_64): acss_0.2-5.tgz |
| Old sources: | acss archive |
| Reverse suggests: | spatialwarnings |
Please use the canonical form https://CRAN.R-project.org/package=acss to link to this page.