4 ms·
In the overview section the author states: >"... there is no self-modifying code, no transport-triggered calculation, and no other form of non-mov cheating."
by bogomipz 5y ago
In the overview section the author states:
>"... there is no self-modifying code, no transport-triggered calculation, and no other form of non-mov cheating."
Could someone say what is meant by "transport-triggered calculation"? Also how does "self-modifying code" work in the context of such constraints exactly? I had a look through the "mov is Turing-complete" paper referenced in this README but didn't come across these.
- iggldiggl 5y agoI guess something like the Wireworld computer? (https://www.quinapalus.com/wires10.html https://www.quinapalus.com/wires10.html – another fascinating topic, by the way…) That one only uses MOVs, too, but the simulated CPU has a number of special registers implementing a number of basic operations, so instead of having to manually implement them the hard way using only MOVs (which in the particular case of the wireworld computer probably wouldn't even be possible due to its constrained resources and architecture), you can "cheat" by simply MOVing your operands into the respective special registers and then reading the result.
- bogomipz 5y agoThanks for the Wireworld link. This is indeed fascinating. Cheers.