User:Stkptr/Sandbox
Jump to navigation
Jump to search
Queuenanimous
This is an explanation of User:Gapples2's proof
We can represent several unary numbers in the queue by having ones be 10 and separators be 00. If a unary number is at the head of the queue, we can subtract one from it using [], which pops off the 1, loops back, then pops off the 0, and exits.
Consider the behavior of [+0]. If there is a nonzero number at the head of the queue, then this will
M = []
R = [+0]>0
L = RR
P = ??L