There's an interesting implication to this. We assume that evolution happens when random mutations (similar to random bit flips, removal or injection?) occur and when the random result has an advantage, the mutation tends to remain in the gene pool.
Yet at the same time the result of this random code is extremely compressed, to the point we compare it to procedural generative code.
Not sure what we can do with this but it certainly seems like we can once again get inspired by nature on this one.
Yet at the same time the result of this random code is extremely compressed, to the point we compare it to procedural generative code.
Not sure what we can do with this but it certainly seems like we can once again get inspired by nature on this one.