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:Unstoppable
Jump to navigation
Jump to search
I've found an intermediate language that might be useful for proving Turing-completeness. Each of these 12x12 grids acts sort of as a single instruction of a larger 2D language with two stacks (named "horizontal stack" and "vertical stack"):
| Intermediate language instruction | Grid |
|---|---|
| NOP | 0 * 0 * * 0 * 0 **00**00**00 0 * * 0 00**00**00** 0 * 0 * * 0 * 0 |
| Turn clockwise | 0 * 0 * 1 0 0 0 **** **10 01** **** 0 0 0 1 * 0 * 0 |
Push X (0 or 1) on horizontal stack |
0 0 0 * * X * 0 **000*X0**00 0 * * 0 00**0X*000** 0 * X * * 0 0 0 |
Push X (0 or 1) or vertical stack |
0 * 0 X * 0 * 0 **00*X00**00 0 * * 0 00**00X*00** 0 * 0 * X 0 * 0 |
| NOP if travelling vertically, pop from horizontal stack and conditionally turn clockwise if travelling horizontally | 0 * 0 * * 0 * 0 **00**00***0 0 * * 0 0***00**00** 0 * 0 * * 0 * 0 |
| NOP if travelling horizontally, pop from vertical stack and conditionally turn clockwise if travelling vertically | 0 * 0 * * 0 0 0 ****0000**00 * * * * 00**0000**** 0 0 0 * * 0 * 0 |
The instruction pointer travels up on the 4th column and down on the 9th, and left on the 5th column and right on the 8th. Blank characters are never run, so they can be replaced by any instruction (e.g. 0). –PkmnQ (talk) 11:34, 26 June 2026 (UTC)