ehawk

Hi, I've been trying to get an answer as to whether this simple, 3-bit mechanical digital computer is in fact Turing Complete: http://en.wikipedia.org/wiki/Digi-Comp_I I have seen references to it as a counter machine (which is Turing-complete), a register machine (of which counter machines are the simplest examples), and as a Von Neumann machine (storing its program separate from data), but no confirmation of these claims or a definitive answer as to whether it's Turing Complete. It can be programmed to play NIM and Tic Tac Toe, I believe (not sure about Tic Tac Toe). I realize that it is of course memory-limited...but it it was expanded, could it carry out the instructions of a similarly long Turing-machine?