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:OW-1
Jump to navigation
Jump to search
Could Someone verify the Turing Complete Proof by actually running it in the program Link and verifying it. Potato Imaginator (talk)
The Minsky Swap code ++*~(0)+ or inc();inc();swap();decnz(0);inc(); turns into
>i>i>.>cTv>d>i>x
> ^
^ <
Which ends with both registers at 2, the expected result. I think this should be a good enough verification though I can do another if needed. Gapples2 (talk) 14:44, 13 June 2022 (UTC)
Please Put the above code as an Example in Turing Complete Proof Potato Imaginator (talk)