On the Kolmogorov-Chaitin Complexity for short sequences

zbMath1137.68412arXiv0704.1043MaRDI QIDQ5448299

Hector Zenil, Jean-Paul Delahaye

Publication date: 20 March 2008

Full work available at URL: https://arxiv.org/abs/0704.1043

zbMATH Keywords

Kolmogorov-Chaitin complexityexperimental approach

Mathematics Subject Classification ID

Algorithmic information theory (Kolmogorov complexity, etc.) (68Q30) Applications of computability and recursion theory (03D80)

Related Items (4)

Analogical proportions: from equality to inequality ⋮ Numerical evaluation of algorithmic complexity for short strings: a glance into the innermost structure of randomness ⋮ Correlation of automorphism group size and topological properties with program-size complexity evaluations of graphs and complex networks ⋮ Algorithmic information dynamics of cellular automata

This page was built for publication: On the Kolmogorov-Chaitin Complexity for short sequences