Entropy measures vs. Kolmogorov complexity

DOI10.3390/E13030595MaRDI QIDQ657548zbMATH OpenOpenAlexWikidataFDO

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

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

Shannon entropyKolmogorov complexityTsallis entropyRényi entropy

Mathematics Subject Classification ID

Measures of information, entropy (94A17)

Recommendations

• Shannon Entropy vs. Kolmogorov Complexity
• scientific article; zbMATH DE number 1304330
• Relations between varieties of kolmogorov complexities
• Comparing Notions of Computational Entropy
• Inequalities for Shannon entropy and Kolmogorov complexity

Cites work

• scientific article; zbMATH DE number 3492569 (Why is no real title available?)
• A Mathematical Theory of Communication
• A formal theory of inductive inference. Part I
• An introduction to Kolmogorov complexity and its applications
• Kolmogorov's contributions to information theory and algorithmic complexity
• On the Length of Programs for Computing Finite Binary Sequences
• Possible generalization of Boltzmann-Gibbs statistics.
• Thermodynamic stability conditions for the Tsallis and Rényi entropies
• Three approaches to the quantitative definition of information^*
• Uniform estimates on the Tsallis entropies

Cited in

(6)

• An entropy based measure for comparing distributions of complexity
• Shannon Entropy vs. Kolmogorov Complexity
• Relating description complexity to entropy
• Entropy of theK-Satisfiability Problem
• The Complexity of Approximating the Entropy
• New statistical models of nonergodic cognitive systems and their pathologies

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q657548)