>
> I have heard that XSLT 1.0 is Turing complete .. Is
> XSLT 2.0 also? If yes, what will be the proof of this
> fact?
>
There is a proof that XSLT 1.0 is Turing complete at
http://www.unidex.com/turing/utm.htm
The proof clearly applies equally to XSLT 2.0 since the Universal Turing
Machine used in the proof is a legal XSLT 2.0 stylesheet.
(This question has no connection with the previous message on the thread,
other than that both are concerned with finite state machines...)
Michael Kay
http://www.saxonica.com/
