13 Feb
2008
13 Feb
'08
5:07 p.m.
Digital, electronic, stored program, Turing-complete.
That's slippery. Strictly, no Turing-complete computer exists, nor can
(as far as we know), because any such machine would have to have
unbounded storage accessible. How close counts?
Yes, I suspect I have a fair idea what you mean - I know what *I* would
mean by that. But until we have a clear definition, we can't be sure.
As a strawman, I propose "would be Turing-complete with the addition of
a (hypothetical) Turing-tape peripheral supporting move-left,
move-right, read-current, and write-current operations".
/~\ The ASCII der Mouse
\ / Ribbon Campaign
X Against HTML mouse at rodents.montreal.qc.ca
/ \ Email! 7D C8 61 52 5D E7 2D 39 4E F1 31 3E E8 B3 27 4B