One interesting way to think about the disordinate ratio of data to complexity is via hash functions. The output space of sha256 is finite, but because input is

One interesting way to think about the disordinate ratio of data to complexity is via hash functions. The output space of sha256 is finite, but because input is infinite, there are infinite collisions in the output space despite each output being pretty much unique for anything we'd want to describe. DNA is like sha256, it's generated by the function life4g(m,f) and is a self-mutating reverse-hasher that creates/finds new inputs with the goal of finding an input that hashes to itself. Also known of live(). The goal of live() is to live(life) = <live source code> or adjust(live). There is an illusion that there is a input life that is an isomorphism of what living is all about. The so called "meaning of life". However this is only because it is forgotten that the input space is infinite and that infinite such isomorphisms exist.