3 ms·
It wouldn't make it turning complete because while the template could read the hypothetical infinite tape, and write infinitely to another tape---it can't write
by true_religion 15y ago
It wouldn't make it turning complete because while the template could read the hypothetical infinite tape, and write infinitely to another tape---it can't write what its written so its prohibited from being turing complete.
It's basically a finite state machine.
Now you can do a whole lot with a FSM---and lo, some people will claim that our current brand of machines are only realistically as powerful as FSMs because of the lack of infinite memory.
- bascule 15y agoThe proposed changes, particularly tail recursion, an if operator, and a zip operator in effect give you a functional language with immutable state. While you can't "write" to the Turing tape as a side effect as the language is immutable, you can create a new "tape" from previous states which is a modified version of the old tape.