• m_‮f@discuss.onlineOP
      5·
      14 days ago

      Apparently not:

      https://math.stackexchange.com/a/3680805

      Shannon Entropy is about compression of (long) words generated by biased die toss. And if dice entropy is H, we can’t (on average) compress results of n tosses to less than n⋅H bits.

      Kolmogorov Complexity is about compression of arbitrary words. Of course, if word is generated by the same die, it’s average complexity will be n⋅H+O(1).

      • tetris11@feddit.ukEnglish
        4·
        13 days ago

        Of course, if word is generated by the same die, it’s average complexity will be n⋅H+O(1).

        Of course.