Entropy measures vs. Kolmogorov complexity
From MaRDI portal
Publication:657548
DOI10.3390/e13030595zbMath1229.94037WikidataQ62038777 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
94A17: Measures of information, entropy
Related Items
Cites Work
- Unnamed Item
- 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