Re: graph traversal

Subject: Re: graph traversal
From: James Robertson <jamesr@xxxxxxxxxxxxxx>
Date: Sun, 20 Feb 2000 15:02:05 +1100
At 08:33 19/02/2000 , David Carlisle wrote:

> How powerful is this XSLT?

it's turing complete (bar memory limits) so you could in principle code
a simulation of a JVM and then run the xt classes in saxon, or vice
versa. Might not be particularly fast though.

Could we can kill this whole "turing complete" nonsence?

In practice, this means absolutely nothing.

For the theory, feel free to research
what it really means.

Just my $0.02,


------------------------- James Robertson Step Two Designs Pty Ltd SGML, XML & HTML Consultancy Illumination: an out-of-the-box Intranet solution

XSL-List info and archive:

Current Thread