There are a multitude of XML based languages....

Post #156,750 by ChrisR 5/24/04 8:11:34 PM Reply	There are a multitude of XML based languages.... ...that are turing complete (XSLT and XQRY for example). But I think for the given purpose of internationalization that doesn't count for much.
Post #156,754 by tablizer 5/24/04 8:29:04 PM Reply	If your config files are TC, then why have 2 langs? ________________ oop.ismad.com
Post #156,757 by ChrisR 5/24/04 8:35:23 PM Reply	Do you really have to ask? If we have OOP languages which are Turing Complete, do we really need TOP languages?
Post #156,777 by tablizer 5/24/04 10:55:40 PM Reply	TC != Easy ________________ oop.ismad.com
Post #156,782 by ChrisR 5/24/04 11:15:07 PM Reply	Exactly. It's not easy doing XML transformations in XQuery and it's not easy doing XML queries in XSLT. Meaning that they are solutions geared for different problem spaces. Not that I particularly like the complexities of either but they both have their reason for existence, even if they happen to overlap. Similary, the consummate Turing Machine is not particularly easy to do day to day computing chores, but it's reason for it's existance is mostly theoretical and mathematical - to establish the outer limits for computability. In terms of expressing the concepts of computability, the turing machine is a very good (and easy to use language). The emphasis in theoretic computability these days lies more with Church and the Lambda Calculus. Some languages have arisen from this effort - ML, Haskell, Scheme. But the primary emphasis in Lambda Calculus (and associated Combinatorial Logic) is providing a mathematical model of computability - in that frame of reference, the Lambda Calculus is much easier to build a foundation upon. Though there are other efforts such as the Relational Calculus (RDBMS), the Predicate Calculus (Logic & Declarative), and the Pi Calculus (distributed processing) - and that's not even getting into the usefulness of Category Theory. Anyhow, the point (if there was a point) is that merely claiming turing complete is not much of a feat. It doesn't tell us much about how well a language can tackle a given problem given resource constraints. So, yes, Turing Tarpit languages like BrainF*ck are Turing Complete, but that doesn't mean they are useful beyond the offhand parlour tricks.
Post #156,758 by admin 5/24/04 8:35:44 PM Reply	One's a hammer, the other is a screwdriver. Regards, -scott anderson "Welcome to Rivendell, Mr. Anderson..."
Post #156,763 by ChrisR 5/24/04 9:03:21 PM Reply	As an aside, that question has popped up in another context Being MS, one can promote the standards that benefit MS, whilst ignoring others. MS has decided that it will go with the latest [link\|http://blogs.msdn.com/mfussell/archive/2004/05/13/130969.aspx\|XQuery but not XSLT 2.0 and XPath]. Mostly I think it's a case of being arbitrary and capricious (a term quite familiar in antritrust cases btw). There are overlaps between the three, but they are geared towards different things - hammers and screwdrivers as Admin is like to say.
Post #156,755 by ChrisR 5/24/04 8:34:25 PM Reply	BTW, Turing machines don't require much. [link\|http://www.angelfire.com/tx4/cus/shapes/brain.html\|brainf*ck] does it with a mere 6 instructions - and two of those are unnecessary since they have to do with I/O. Even shorter are [link\|http://www.angelfire.com/tx4/cus/combinator/birds.html\|SK Combinators] which achieve Turing completeness with a mere two combinators: K such that: Kab = a\n S such that: Sabc = ac(bc) Or you can even get down to [link\|http://www.cs.uu.nl/people/jeroen/article/combinat/index.html\|one combinator]. Not that you really want to program in these turing complete languages. :-)

Welcome to IWETHEY!