From: Robin Becker <robin@...>
Date: 2002-11-07T04:05:44+09:00
Subject: Re: A vision for Parrot

In article <aqbimo$a36$1@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