r-acss 0.2-5 Algorithmic complexity for short strings
The main purpose of this package is to provide the algorithmic complexity for short strings, an approximation of the Kolmogorov Complexity of a short string using the coding theorem method. While 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.
- Website: http://complexitycalculator.com/methodology.html
- License: GPL 2+
- Package source: cran.scm
- Patches: None
- Builds: x86_64-linux, i686-linux