LATEX-L Archives

Mailing list for the LaTeX3 project

LATEX-L@LISTSERV.UNI-HEIDELBERG.DE

Options: Use Classic View

Use Monospaced Font
Show HTML Part by Default
Condense Mail Headers

Topic: [<< First] [< Prev] [Next >] [Last >>]

Print Reply
Sender: Mailing list for the LaTeX3 project <[log in to unmask]>
From: Hans Aberg <[log in to unmask]>
Date: Tue, 3 Nov 1998 13:28:07 +0100
In-Reply-To: <[log in to unmask]>
Reply-To: Mailing list for the LaTeX3 project <[log in to unmask]>
Parts/Attachments: text/plain (16 lines)
At 12:53 +0100 1998/11/03, Chris Rowley wrote:
>By contrast, clever TeX code showing that "TeX can do it" is not so
>useful, right now, for this type of parsing problem: since TeX (and
>even its expansion mechanism alone) is Turing complete "TeX can do all
>parsing and string manipulation".

  The Turing argument is not so interesting in the context of computer
languages, because firstly computers are not Turing machines, and second
the equivalence between Turing machines normally do not preserve the other
semantic structures that one wants to describe.

  Hans Aberg
                  * Email: Hans Aberg <mailto:[log in to unmask]>
                  * Home Page: <http://www.matematik.su.se/~haberg/>
                  * AMS member listing: <http://www.ams.org/cml/>

ATOM RSS1 RSS2