acss
From MaRDI portal
Software:22949
swMATH10997CRANacssMaRDI QIDQ22949
Algorithmic Complexity for Short Strings
Henrik Singmann, Nicolas Gauvrit
Last update: 25 November 2014
Copyright license: GNU General Public License, version 3.0, GNU General Public License, version 2.0
Software version identifier: 0.2-5
Source code repository: https://github.com/cran/acss
Related Items (10)
Computable model discovery and high-level-programming approximations to algorithmic complexity ⋮ On graph entropy measures based on the number of independent sets and matchings ⋮ 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 ⋮ Correspondence and Independence of Numerical Evaluations of Algorithmic Information Measures ⋮ 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
This page was built for software: acss