Talk:0815
I think the & instruction means your queue is actually a deque, even if it has slightly more direct commands to use it as a queue. --Ørjan (talk) 01:33, 11 February 2013 (UTC)
Language Details are not clear
the registers X,Y,Z are 64Bit signed Integer, but the Fibonacci example has 0xa94fad42221f2702h as Input.
0xa94fad42221f2702h = DEC 12,200,160,415,121,876,738
int64: –9,223,372,036,854,775,808 to 9,223,372,036,854,775,807
uint64: 0 to 18,446,744,073,709,551,615
since 0xa94fad42221f2702h is a Fibonacci number, I think its the abort condition for the algorithm, but it doesnt fit in int64. Shoud the registers be uint64?
proof of TC’ness incorrect
since all the registers are bounded and a minsky machine needs a finite amount pf unbounded registers or infinitely many of them to be TC, this proof is incorrect