It took me a bit to grok this but I think I finally understand it. Super clever.
Now, how would you do greater than / less than comparisons?
Re:MOV is Turing-complete (2013) [pdf]
by magicalhippo on Tuesday February 18, 2020 @04:05PM
(#22360395)
The native and super inefficient way would be basically the same: write 1 to all addresses greater or equal to X, and 0 to all addresses less than X, then read from address Y and see what you end up with.
Probably a more clever trick out there though.
If X and Y are equal, then you would have written first 0 and then 1 to the same address, so the final read would give you 1.
If X and Y are different, then you would read back the 0 you wrote to address X.