Talk:QX

adding a note here since I don't have the time to do this at the moment—a proof w/o infinity should be possible by simulating the wrapping behavior for + and -, then replacing ∞ and -∞ with 257 and 0 respectively —aadenboy (talk|contribs) 14:03, 5 December 2025 (UTC)

I kind of want to find a proof that works even if you only have the characters Q, X, 1, space, and newline. It should also be Turing complete with only one line, given the existence of Brainpocalypse. –PkmnQ (talk) 16:16, 5 December 2025 (UTC)

You can translate Brainpocalypse to QX

Brainpocalypse	QX
<	X 0 n where n is next line
>	X lim 0 where lim is the absolute limit of the numbers
+	Q 1
-	Q -1

mariomakercalculator↑↑↑↑↑↑↑↑↑↑↑↑↑↑ 14:40, 5 December 2025 (BRZ)

- should be X lim 0 X 1 d X -1 s X -1 1 Q -1, where d is Q -1 and s is X -1 1 —aadenboy (talk|contribs) 17:58, 5 December 2025 (UTC)