acss

swMATH10997CRANacssMaRDI QIDQ22949FDOQ22949

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

Cited In (10)

• Correspondence and Independence of Numerical Evaluations of Algorithmic Information Measures
• Computable model discovery and high-level-programming approximations to algorithmic complexity
• Analogical proportions: from equality to inequality
• Algorithmic information dynamics of cellular automata
• 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
• On graph entropy measures based on the number of independent sets and matchings
• Correlation of automorphism group size and topological properties with program-size complexity evaluations of graphs and complex networks
• Model discovery and discrete inverse problems with cellular automata and Boolean networks
• An algorithmic look at financial volatility

This page was built for software: acss