Run-time code generation being faster than static code generation isn't fundamentally weird: as an example, take a program that takes (pure) C code as input, ev

Run-time code generation being faster than static code generation isn't fundamentally weird: as an example, take a program that takes (pure) C code as input, evaluates it, and returns its exit status – compiling the code and running it could be much faster than interpreting it. In fact, variants of this are significant features of general-purpose processors. The fact that many programs written in dynamic languages can be sped-up in this way is slightly surprising, as they are a different family of examples, but isn't much different on a fundamental level. On a different note, if dark silicon becomes cheap, then general-purpose processors would become less important, as one could have a computer system consist of thousands of independent systems, each for a different purpose. If dark RAM would also be cheap, then giving each such processor its own memory could eliminate the need for MMU-s.