acss
From MaRDI portal
Acss
Description
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.
Cited in
(11)- On measuring the complexity of networks: Kolmogorov complexity versus entropy
- A computable measure of algorithmic probability by finite approximations with an application to integer sequences
- An algorithmic look at financial volatility
- Analogical proportions: from equality to inequality
- Correlation of automorphism group size and topological properties with program-size complexity evaluations of graphs and complex networks
- Algorithmic information dynamics of cellular automata
- Model discovery and discrete inverse problems with cellular automata and Boolean networks
- Computable model discovery and high-level-programming approximations to algorithmic complexity
- OACC
- On graph entropy measures based on the number of independent sets and matchings
- Correspondence and independence of numerical evaluations of algorithmic information measures
This page was built for software: acss
