On Nov 3, 2007 5:00 AM, Ryan Dickie <[EMAIL PROTECTED]> wrote: > Lossless File compression, AKA entropy coding, attempts to maximize the > amount of information per bit (or byte) to be as close to the entropy as > possible. Basically, gzip is measuring (approximating) the amount of > "information" contained in the code.
Hmmm, interesting idea. > > I think it would be interesting to compare the ratios between raw file size > its entropy (we can come up with a precise metric later). This would show us > how concise the language and code actually is. Yeah, let's all write in bytecode using a hex editor :-D _______________________________________________ Haskell-Cafe mailing list Haskell-Cafe@haskell.org http://www.haskell.org/mailman/listinfo/haskell-cafe
