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.
- Version0.2-5
- R version≥ 2.15.0
- LicenseGPL-2
- LicenseGPL-3
- Needs compilation?No
- acss citation info
- Last release11/25/2014
Documentation
Team
Henrik Singmann
Nicolas Gauvrit
Show author detailsRolesAuthorFernando Soler Toscano
Show author detailsRolesContributorHector Zenil
Show author detailsRolesContributor
Insights
Last 30 days
Last 365 days
The following line graph shows the downloads per day. You can hover over the graph to see the exact number of downloads per day.
Data provided by CRAN
Binaries
Dependencies
- Depends2 packages
- Imports1 package
- Suggests2 packages
- Reverse Suggests1 package