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.
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.
How do we know this is Turing Complete? I assume for starters that the memory values and address space are both unbounded. I would guess that simulating a Minsky machine might be the quickest approach. --Nthern (talk) 19:01, 14 November 2018 (UTC)