Let’s start with my first thoughts, involving:
By limiting the tape to a limited amount of cells, it is possible to wrap around, removing the need for the < in Jumpmin.
Here’s a problem that may stand out really quickly, and that’s of how limiting the tape removes Turing Completeness. To solve it, I propose a new command.
What this does is take the value in the current cell set a border nth + 1 cells away. When we make it to that cell, we are instantly moved back to the first cell, and remove the border. This practically simulates having limited tape, while still staying Turing Complete.
Of course all this does is add a new command in place of another, which just makes coding harder.
Remember what was done to
?? We combine
“Set a border nth + 1 cells away, then shift the pointer to the right, while n is the cell’s current value before shifting the pointer.”
“Set a border nth + 1 cells away, then shift the pointer to the right, while n is the cell’s current value before shifting the pointer. If n is 0, the first part will not execute.”