Talk:Mhm!/Turing-completeness proof

this program is best viewed in my interpreter with --showloose=b,b.,c... Mhm! is definitely more space-inclined than pointer-inclined, and I wonder if reinterpreting it as a tree would help. I'm finding that bits can very easily be encoded with a [X] [0] [X] structure to allow for 0 and 1 tests (as used in this program) and you can easily ignore the danger of ( by simply nesting one or more levels deeper (thus making all indexes always 0 in the parent's perspective) —aadenboy (talk|contribs) 17:44, 27 April 2026 (UTC)