@dosnostalgic this is very cool! The cited paper ("mov is Turing-complete" by Stephen Dolan) explains how this works, the fundamental part is that you can perform comparisons with just mov instructions by storing a value X in [RegA], then a different value Y in [RegB], and finally load [RegA] into RegC: register C will now be Y if registers A and B are equal, otherwise it will be X.