1. 16

  2. 3

    Very funny idea, and do read the referenced “mov is Turing-complete”, by Stephen Dolan which is both technically fascinating and very snarky.

    1. 1

      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. :-)

      Stories with similar links:

      1. Movfuscator: the single instruction C compiler via lazythunk 3 years ago | 27 points | no comments