Title of article :
A proof of the Beyer–Stein–Ulam relation between complexity and entropy
Author/Authors :
Stefano Galatolo ، نويسنده ,
Issue Information :
روزنامه با شماره پیاپی سال 2000
Abstract :
We present a proof of a conjecture stated by Beyer, Stein and Ulam in 1971. The authors conjectured a relation between Kolmogorov complexity and information entropy.
Keywords :
Entropy , Kolmogorov , Complexity
Journal title :
Discrete Mathematics
Journal title :
Discrete Mathematics
