mov is Turing-complete
It is well-known that the x86 instruction set is baroque, overcomplicated, and redundantly redundant. We show just how much fluff
it has by demonstrating that it remains Turing-complete when reduced to just one instruction.
Mon Sep 23 12:46:43 2013 - permalink -
-
http://www.cl.cam.ac.uk/~sd601/papers/mov.pdf