mov Is Turing-complete

Stephen Dolan (PDF, via Emily St.): 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. The instruction we choose is mov, which can do both loads and stores. We use … Continue reading mov Is Turing-complete