User talk:I am islptng/TCP1

How User:Cycwin proved TCP1 to be Turing-complete? How ability to arbitrary increment and decrement three registers and make loops proves to be TC? TBPO 16:22, 1 May 2025 (UTC)

3-cell (unbounded, can store arbitrary natural numbers)bf is TC, even without I/O; Replacing < and > with the 3 commands that move the pointer to one of the 3 cells is also TC. Alternatively, PMMN can be compiled into it. -- i  s  l  p  t  n  g  00:21, 2 May 2025 (UTC)

In fact, we can completely simulate the complete brainfuck. Since the author islptng didn't say that variables are finite at all, we can set infinite variables to simulate brainfuck's cells. Because brainfuck is Turing complete, TCP1 Turing complete. If you are still not satisfied with this, I also have a Turing complete proof that simulates minsky machine. --User:Cycwin