cross-posted from: https://discuss.online/post/47104686

http://www.smbc-comics.com/comic/funeral

Alt textActually for me you can get it down to an eyeroll and a tired sigh.

Bonus panelBonus panel

you are viewing a single comment's thread
view the rest of the comments
[–] 5 points 2 weeks ago* (2 children)

Isn't that just Shannon Entropy but with extra steps

  • source
  • parent
  • hideshow 2 child comments
  • [–] [S] 5 points 2 weeks ago (1 child)

    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).

  • source
  • parent
  • hideshow 1 child comment