We are currently working on new rules for what content should and shouldn't be allowed on this website, and are looking for feedback! See Esolang:2026 topicality proposal to view and give feedback on the current draft.
Talk:Push-up automaton
Confusion
This seems like a joke which went a little too far.
Anyways, here are my ideas for what this could be:
- a machine where you can move freely around on the tape (like a Turing machine) but instead of a finite-state automaton, something is attached which doesn't have enough computational power for it to be Turing-complete
- a machine which involves an infinite state machine and a bounded stack (which also covers the idea of "a machine that's more powerful, not less, than a Turing machine")
ICTLM Question
If I understand correctly, an ICTLM should be able to freely edit the tape and freely move around on the tape as long as it doesn't use values it previously had access to or change the underlying logic in some way. For example, if you always added 1 to the cell you were on, then jumped to the cell with the value of the cell to the right of the one you were on, that would still be combinatorial logic, right? The inputs are the two cells, and then the output and movement are purely relegated to the tape.
Am I wrong?
Squidmanescape (talk) 07:45, 10 October 2026 (UTC)