Talk:Mhm!

this was originally meant to be an April Fools' joke but it turned into a possible tarpit —aadenboy (talk|contribs) 17:13, 1 April 2026 (UTC)

Negative indexed cells?

I assume, by how the commands work, there is such a thing as negative indexed cells?

that's correct (there's actually no way to get to positive indexed cells, so for all intents and purposes the negative distinction isn't necessary) —aadenboy (talk|contribs) 16:51, 2 April 2026 (UTC)

So you can't move onto unusable cells? --Yayimhere2(school) (talk) 09:21, 5 April 2026 (UTC)

you are able to move onto unusable cells, just not any after the cell at index 0 —aadenboy (talk|contribs) 16:13, 5 April 2026 (UTC)

Ah, ok! well then, im ready to rewrite the page!

Completeness

I was able to translate Ultimate bf instruction minimalization! into Mhm!, but I misunderstood the language as being Turing-complete (it's listed in Turing tarpit yet is unknown completeness) so this doesn't prove TC unfortunately

^( make the first cell unusable as a safeguard
) ) ) move off of safeguard and onto cell 3
^[
  command 1
  ( you can always move at least once to the left
  ^) ^) move out of the way for check
  ^^[
    ^( ^( move back
    ( move left for balanced movement
    ^^[ precheck to make sure the cell is initialized with the required cells
      ^^( first cell is unusable as guard
      ^) ^^^( second cell only has a flag
      ^( move back
    ]
  ]
  ) this movement causes movement rightwards if and only if the cell we tried to move to was unusable
  
  command 2
  ) move to the next cell
  ^^[ precheck to make sure the cell is initialized with the required cells
    ^^( first cell is unusable as guard
    ^) ^^^( second cell only has a flag
    ^( move back
  ]
  ^) move the cell to the right, flipping it
  ^^[ preemptively move to 0 early given later movement
    ^) ^^(
  ]
  ^[
    command to run if cell is 1
    ^) ^) ^) ^^( move to unusable cell to exit
  ]
  ^( ^( ^( move back
]

—aadenboy (talk|contribs) 00:46, 18 April 2026 (UTC)

BCT might be implementable given copying behavior in the division algorithm and bitflip procedure with conditional check as seen in the above example —aadenboy (talk|contribs) 04:54, 19 April 2026 (UTC)