Correspondence and Independence of Numerical Evaluations of Algorithmic Information Measures

DOI10.3233/COM-13019zbMath1286.68252arXiv1211.4891OpenAlexW1829060681MaRDI QIDQ5413744

Fernando Soler-Toscano, Nicolas Gauvrit, Hector Zenil, Jean-Paul Delahaye

Publication date: 30 April 2014

Published in: Computability (Search for Journal in Brave)

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

Mathematics Subject Classification ID

Algorithmic information theory (Kolmogorov complexity, etc.) (68Q30)

Related Items (5)

A computable measure of algorithmic probability by finite approximations with an application to integer sequences ⋮ Analogical proportions: from equality to inequality ⋮ Is there any real substance to the claims for a ``new computationalism? ⋮ Correlation of automorphism group size and topological properties with program-size complexity evaluations of graphs and complex networks ⋮ Algorithmic information dynamics of cellular automata

Uses Software

• OACC
• acss

This page was built for publication: Correspondence and Independence of Numerical Evaluations of Algorithmic Information Measures