rubicon processer 3

[zantrua]

bipavug
Hope you like it.  I think it is Turing complete, because I think it classifys as a bounded storage machine with interactive input, but I'm not sure...
Here is how it works

1 add current cell to the end of the code queue.  might be a while before it runs...
2 output current cell
3 take a box of input, set current cell
4 rotate cell loop counter clockwise, putting current cell on loop
5 add 1 to current cell
6 subtract 1 from current cell

[anka]

There is a bug in the machine. If you put in the code "5452" the output will be 2 instead of one. It is because the memory for "count up/count down" is not updated correctly.
I changed it so it should work correctly: kogirob

PS.
I do not think it is Turing-complete. It is for example impossible to write an infinite loop (that does more then add a 1-barrel to the code-que).
Because to copy one operation to the code que, you need at least two operations (unless it is the same as the last one)