A vision for Parrot
Robin Becker
robin at jessikat.fsnet.co.uk
Wed Nov 6 13:43:47 EST 2002
In article <aqbimo$a36$1 at news.ox.ac.uk>, Frodo Morris
.
.....
>> The problem that people keep forgetting is that Turing Equivilence
>> requires indefinite memory. Turing Machines are defined as having
>> infinite "tapes". Given any finite memory size, I can come up with
>> an interpreter the emulation of which would not fit in that finite
>> memory size.
>Perdantick bast. :-)
>Imagine if parrot could understand all currently- and popularly-
>implemented interpreted languages.
>
which language was it that got kicked to death by the others?
--
Robin Becker
More information about the Python-list
mailing list