Turing Compliant?

[Christian Tismer]

François Pinard wrote:
> 
> Skip Montanaro <skip at mojam.com> writes:
> 
> > A Turing Complete language is one that can compute anything that you
> > can compute with a simple Turing machine.
> 
> A "simple" Turing machine has infinite memory.  Who has that? :-)

Well, this is not so hard:
Emulate the "infinite tape" by a class which is able to read
and write from removeable disks, and whenever a partial tape
end is hit, let the user "insert a new disk" on demand.

Which is of course limited by money.

But I believe much earlier will the machine break, and you have
to replace it while the program runs. Well, pickling state
from time to time would do this. Well, no pickle needed,
just write out the current tape head position all the time,
and you have the state.

or-just-post-your-data-to-a-mailing-list--eGroups-is-infinite - chris

-- 
Christian Tismer             :^)   <mailto:tismer at appliedbiometrics.com>
Applied Biometrics GmbH      :     Have a break! Take a ride on Python's
Kaiserin-Augusta-Allee 101   :    *Starship* http://starship.python.net
10553 Berlin                 :     PGP key -> http://wwwkeys.pgp.net
PGP Fingerprint       E182 71C7 1A9D 66E9 9D15  D3CC D4D7 93E2 1FAE F6DF
     we're tired of banana software - shipped green, ripens at home