Very funny idea, and do read the referenced “mov is Turing-complete”, by Stephen Dolan which is both technically fascinating and very snarky.
This is in a similar vein, but proving the x86 MMU is Turing complete. i.e. computation with 0 instructions.
As this accepts mov’s as input you could run this on the output of the movfuscator. :-)