3 ms·
The Intel architecture is already Turing complete when you just use MOV instructions: https://github.com/xoreaxeaxeax/movfuscator https://github.com/xoreaxeaxea
by gsliepen 1y ago
The Intel architecture is already Turing complete when you just use MOV instructions: https://github.com/xoreaxeaxeax/movfuscator https://github.com/xoreaxeaxeax/movfuscator. Of course, you don't even need instructions at all: https://news.ycombinator.com/item?id=5261598 https://news.ycombinator.com/item?id=5261598
- QuadmasterXLII 1y agoWhile this is true, I suspect a spec compliant implementation of the x86 mov instruction would many use more transistors than OP’s entire CPU.
- crest 1y agoOf course, but you don't have the toy CPU under your desk or in your laptop running at several GHz nor are you likely to find it in a target that really needs a cute hack to obscure your exploit.
- mk_stjames 1y agoI came back to reply with just this. Christopher Domas's conference talk on the movfuscator is legendary: https://www.youtube.com/watch?v=R7EEoWg6Ekk https://www.youtube.com/watch?v=R7EEoWg6Ekk
- aleph_minus_one 1y ago> The Intel architecture is already Turing complete when you just use MOV instructions No physically existing architecture is Turing-complete, since every CPU can (by physics) only access a finite amount of memory, which means that its state space is finite, in opposite to the infinite state space of a Turing machine.
- deleted 1y ago[deleted]
- jdiff 1y agoBut that's not a very useful definition so we usually don't both enforcing that constraint.