[Date Prev][Date Next][Thread Prev][Thread Next][Date Index][Thread Index]

Re: are dylan macros Turing-complete?

To: address@hidden
Subject: Re: are dylan macros Turing-complete?
From: Bruce Hoult <address@hidden>
Date: Wed, 08 May 2002 19:45:01 -0400
Organization: TelstraClear
References: <sn5287jlrb.church.of.emacs@localhost.verbum.private>
Sender: "Gregory T. Sullivan" <address@hidden>
User-agent: MT-NewsWatcher/3.2 (PPC Mac OS X)
Xref: traf.lcs.mit.edu comp.lang.dylan:14148

In article <sn5287jlrb.church.of.emacs@localhost.verbum.private>,
 Colin Walters <walters@verbum.org> wrote:

> Anyways, in this paper I'm writing, I claim (without real proof) that
> Dylan macros are not Turing-complete.  I'd just like to confirm that
> this is in fact the case.

It's pretty easy to translate Turing machine programs into Dylan using a 
list of tokens as the tape and macros as the program.

Dylan macros are definitely Turing-complete...

-- Bruce

References:
- are dylan macros Turing-complete?
  - From: Colin Walters <walters@verbum.org>

Prev by Date: are dylan macros Turing-complete?
Next by Date: Re: are dylan macros Turing-complete?
Previous by thread: are dylan macros Turing-complete?
Next by thread: Re: are dylan macros Turing-complete?
Index(es):
- Date
- Thread