• Title of article

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

  • Author/Authors

    Stefano Galatolo ، نويسنده ,

  • Issue Information
    روزنامه با شماره پیاپی سال 2000
  • Pages
    6
  • From page
    367
  • To page
    372
  • 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
  • Serial Year
    2000
  • Journal title
    Discrete Mathematics
  • Record number

    950569

    • Link To Document
    https://search.isc.ac/dl/search/defaultta.aspx?DTC=10&DC=950569