[lmm]

> You can test an information stream for entropy and you can also determine whether there is any entropy left in a compressed information stream.

I don't think that measures the thing that needs to be measured here. Kolmogorov complexity is famously uncomputable; the output of a pseudo-random number generator will be high-entropy but "really" only contains a tiny amount of information (the initial seed).

And more to the point, DNA certainly contains more than 10MB of entropy; the claim is that most of this DNA is junk. Fair enough, but I expect the 10MB of DF code is also mostly junk: irrelevant details that the programmers were unnecessarily required to specify or the compiler picked out, rather than actually expressing the details of behaviour.