Re: [xml-dev] Schematron: Categories of Usage?

["bryan rasmussen" <rasmussen.bryan@gmail.com>]

There are a good number of algorithms that do not require
computational completeness to be run. In fact I guess if you take
Kleene''s definition it may be most of them.

At any rate, as I was trying to convey and probably did a poor job at.
If you know the exact limitations of a computation there can maybe be
a non-turing language that can run it, the writing of the program can
be a pain, this is why you can use a language with iterative processes
to write the program in the language without iteration.

this perhaps feeds back into all the principle of least power stuff
people have been discussing.

Cheers,
Bryan Rasmussen

On 1/22/07, Michael Kay <mike@saxonica.com> wrote:
> > Algorithmic Checking: the validity of data in an XML instance
> > document is determined not by mere examination or comparison
> > of the data, but requires performing an algorithm on the data.
>
> I'm not quite sure "algorithm" is an appropriate term, given that XPath is
> not computationally complete: but I can't immediately think of anything
> better.
>
> Michael Kay
> http://www.saxonica.com/
>
>
> _______________________________________________________________________
>
> XML-DEV is a publicly archived, unmoderated list hosted by OASIS
> to support XML implementation and development. To minimize
> spam in the archives, you must subscribe before posting.
>
> [Un]Subscribe/change address: http://www.oasis-open.org/mlmanage/
> Or unsubscribe: xml-dev-unsubscribe@lists.xml.org
> subscribe: xml-dev-subscribe@lists.xml.org
> List archive: http://lists.xml.org/archives/xml-dev/
> List Guidelines: http://www.oasis-open.org/maillists/guidelines.php
>
>