J
JosephKK
Nobody [email protected] posted to sci.electronics.design:
The answer is right there in wikipedia. All you need to do is ask it.
But the article doesn't state *why* they don't consider it to be
Turing-complete. In practice, this could either mean that it cannot
implement an unbounded loop, or that it doesn't have access to
unlimited external storage. If it's the latter, that's probably an
inappropriate distinction; a standalone PC isn't Turing-complete in
that sense, either.
Being programmable only through re-wiring isn't qualitatively
different from being programmable only through punched tape, unless
the system can re-write its own punched tape.
The first stored-program computers didn't appear until the early
1950s (Manchester Mk1 and EDSAC).
The answer is right there in wikipedia. All you need to do is ask it.