From: Wejn <lists+rubytalk@...>
Date: 2002-11-07T01:25:40+09:00
Subject: Re: A vision for Parrot

Hi,

> 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.

  hmm, everytime I hear "bytecode interpreter" I imagine something like
higher level CPU (CISC/RISC doesn't matter). And ... if we have CPU,
"language X" compiler and assembler for that CPU, we might be able to
run "language X" anywhere the virtualCPU runs ... therefore I don't
understand your argumentation about TE. It *might* be slower than native
implementation of X, but it will be possible (at least) -- without crazy
things like infinite resources. Everything depends on the three parts
mentioned above: compiler, assembler, b. interpreter.
  I think parrot isn't about "(si|e)mulation" ... it's about compilation.

Sincerely,
                 W.
-- 
              Wejn <lists+rubytalk(at)box.cz>
(svamberk.net's Linux section, fi.muni.cz student, linuxfan)
>>>         Bored?  Want hours of entertainment?         <<<
>>>           Just set the initdefault to 6!             <<<