Revision as of 21:11, 21 February 2013 (view source) Grondilu (talk \| contribs) (Created page with "==Naïve implementation?== I wonder if there is a way to make a smarter way of calculating the entropy. Repetitive patterns should reduce the entropy, for instance. Basical...")		Revision as of 21:14, 21 February 2013 (view source) Grondilu (talk \| contribs) m (→‎Naïve implementation?) Newer edit →
Line 1: ==Naïve implementation?== I wonder if there is a way to make a smarter way of calculating the entropy. Repetitive patterns should reduce the entropy, for instance. Basically, the entropy should be the number of bits returned by the best possible ever compression program, ~~right?~~or something. Even better: the size of the smallest computing program that outputs the sequence.--[[User:Grondilu\|Grondilu]] 21:11, 21 February 2013 (UTC)

Talk:Entropy: Difference between revisions

Talk:Entropy (view source)