3 ms·
Indeed. Jump on zero and integer manipulation are sufficient for turing-completeness. For example: https://en.wikipedia.org/wiki/Counter_machine https://en.wiki
by qsort 5y ago
Indeed. Jump on zero and integer manipulation are sufficient for turing-completeness. For example: https://en.wikipedia.org/wiki/Counter_machine https://en.wikipedia.org/wiki/Counter_machine
- MaulingMonkey 5y agoAll you really need is `mov`. https://github.com/xoreaxeaxeax/movfuscator https://github.com/xoreaxeaxeax/movfuscator https://www.youtube.com/watch?v=R7EEoWg6Ekk https://www.youtube.com/watch?v=R7EEoWg6Ekk
- deleted 5y ago[deleted]
- qsort 5y agoSUBLEQ :) https://en.wikipedia.org/wiki/One-instruction_set_computer https://en.wikipedia.org/wiki/One-instruction_set_computer
- Sharlin 5y agoIt’s a pretty fun and enlightening exercise to sit down and work out how you’d implement all the usual instructions when all you have is Subtract And Branch If Negative.
- tromp 5y agoλx. x S K https://en.wikipedia.org/wiki/Combinatory_logic#One-point_basis https://en.wikipedia.org/wiki/Combinatory_logic#One-point_ba...
- outadoc 5y agoAll you need is `mov` `mov` `mov` is all you need.
- nwithan8 5y agoCan it compare two values and do one thing or another depending on that comparison? (IF) Can it do something multiple times? (LOOP) Can it change a piece of data? Congrats, it's Turing complete.