Entropy measures vs. Kolmogorov complexity

DOI10.3390/e13030595zbMath1229.94037OpenAlexW2080341202WikidataQ62038777 ScholiaQ62038777MaRDI QIDQ657548

Luís Antunes, André Souto, Armando B. Matos, Andreia Sofia Teixeira

Publication date: 9 January 2012

Published in: Entropy (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.3390/e13030595

zbMATH Keywords

Kolmogorov complexityTsallis entropyShannon entropyRényi entropy

Mathematics Subject Classification ID

Measures of information, entropy (94A17)

Related Items (1)

New statistical models of nonergodic cognitive systems and their pathologies

Cites Work

• A Mathematical Theory of Communication
• Kolmogorov's contributions to information theory and algorithmic complexity
• Possible generalization of Boltzmann-Gibbs statistics.
• Thermodynamic stability conditions for the Tsallis and Rényi entropies
• Uniform estimates on the Tsallis entropies
• On the Length of Programs for Computing Finite Binary Sequences
• Three approaches to the quantitative definition of information^*
• A formal theory of inductive inference. Part I
• An introduction to Kolmogorov complexity and its applications
• Unnamed Item

This page was built for publication: Entropy measures vs. Kolmogorov complexity