acss (Q22949)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
Algorithmic Complexity for Short Strings
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | acss |
Algorithmic Complexity for Short Strings |
Statements
expanded from: GPL (≥ 2) (English)
0 references
Nicolas Gauvrit
0 references
21 May 2025
0 references
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.
0 references
Identifiers
0 references
