Hacker News Reader

Indeed. Jump on zero and integer manipulation are sufficient for turing-completeness. For example: https://en.wikipedia.org/wiki/Counter_machine

View on HN

Can 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.

All you really need is `mov`.

https://github.com/xoreaxeaxeax/movfuscator

https://www.youtube.com/watch?v=R7EEoWg6Ekk

SUBLEQ :)

https://en.wikipedia.org/wiki/One-instruction_set_computer

It’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.

λx. x S K

https://en.wikipedia.org/wiki/Combinatory_logic#One-point_ba...

All you need is `mov`

`mov`

`mov` is all you need.

Reply on news.ycombinator.com