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