[EMAIL PROTECTED] wrote:
Conceptually. Conceptually a physical thing. It isn't *really* a
physical machine.
In practice, you don't get an infinite tape to process, nor do you get
an unbounded but finite time in which to do the computation.
You don't need an infinite tape.
Uh, no. You *do* need an infinite tape. In fact, I'm pretty sure that
the proof of the halting problem is dependent upon this fact.
BTW, Turing machines are not the only abstraction for computability.
IIRC, Lambda Calculus was devloped for the same purpose and it was later
proved that the two formulations are equivalent.
-a
--
[email protected]
http://www.kernel-panic.org/cgi-bin/mailman/listinfo/kplug-list
