A proof of the Beyer-Stein-Ulam relation between complexity and entropy

DOI10.1016/S0012-365X(00)00100-XzbMath0971.68078OpenAlexW2052047179MaRDI QIDQ1587621

Stefano Galatolo

Publication date: 3 December 2000

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0012-365x(00)00100-x

zbMATH Keywords

Kolmogorov complexityinformation entropy

Mathematics Subject Classification ID

Algorithmic information theory (Kolmogorov complexity, etc.) (68Q30) Measures of information, entropy (94A17)

Related Items (1)

Entropic measures, Markov information sources and complexity

This page was built for publication: A proof of the Beyer-Stein-Ulam relation between complexity and entropy