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.
Punching machine
Jump to navigation
Jump to search
| Paradigm(s) | Turing Machine |
|---|---|
| Designed by | User:GUAqwq |
| Appeared in | 2026 |
| Computational class | Turing complete |
| Major implementations | Unimplemented |
Punching Machine is a variation of Turing-machine. It has an infinite length tape with left boundary, and has 2 characters only: blank and punched. The amount of states is unlimited.
Like a regular Turing-machine, for each step the machine runs, it checks the current cell, overwrite the cell, go left or right, and change its state. What's unique to the Punching Machine is that it cannot set a punched cell back to blank, since you can't recover a damaged tape.
Turing-completeness
See Brainfuck_minus_- for a proof.