The instruction we choose is mov, which can do both loads and stores. We use no unusual addressing modes, self-modifying code, or runtime code generation. Using just this instruction (anda single unconditional branch at the end of the program to make non termination possible), we demonstrate how an arbitrary Turing machine can be simulated. - pdf / HN

• Binary search can be implemented using conditional move instructions - tightly packed nodes or nodes which are all in L1 is one place where plain cmov can win.
• Movfuscator: Compile C into only mov instructions / HN

see also

• x86 is Turing-complete with no registers