OASIS Mailing List ArchivesView the OASIS mailing list archive below
or browse/search using MarkMail.


Help: OASIS Mailing Lists Help | MarkMail Help

[Date Prev] | [Thread Prev] | [Thread Next] | [Date Next] -- [Date Index] | [Thread Index]
Re: [xml-dev] RE: XML parsers use what computational power?

On Tue, 2013-04-09 at 21:48 +0100, David Sheets wrote:
> [...]

>  I don't see how one could encode, e.g.,
> SK calculus in XML's entity resolution semantics.
> Can you set XML parsers into infinite loops via entity resolution?
> Afaik, entities cannot be self-referential and support no
> parameterization...

Correct; for Turing-completeness you generally need some sort of
conditional test, and we don't really have that.

You could implement an entity resolver that ran XSLT :-) but that's

Liam Quin - XML Activity Lead, W3C, http://www.w3.org/People/Quin/
Pictures from old books: http://fromoldbooks.org/
Ankh: irc.sorcery.net irc.gnome.org freenode/#xml

[Date Prev] | [Thread Prev] | [Thread Next] | [Date Next] -- [Date Index] | [Thread Index]

News | XML in Industry | Calendar | XML Registry
Marketplace | Resources | MyXML.org | Sponsors | Privacy Statement

Copyright 1993-2007 XML.org. This site is hosted by OASIS