[K0balt]

>Is an imagined VM Turing complete?

Fascinating question. My “vibe” opinion is that it is, but there are limits on the meaning of Turing completeness that do not apply within traditional computing paradigms, vis a vis scaling costs. My intuition is that scaling costs in imaginary VMs would be quadratic rather that linear, e.g. a task that takes twice the memory takes ^2 compute instead.