- From: C. M. Sperberg-McQueen <cmsmcq@blackmesatech.com>
- Date: Thu, 18 Oct 2012 10:50:21 -0600
- To: Michael Kay <mike@saxonica.com>
- Cc: "C. M. Sperberg-McQueen" <cmsmcq@blackmesatech.com>, xmlschema-dev@w3.org
On Oct 18, 2012, at 9:15 AM, Michael Kay wrote: > Michael, I'm sure that you prove mathematically, if you put your mind to it, that a Turing machine (or even a Java compiler...) is a conformant XML Schema processor. But there are users out there who have practical problems to solve, and I'm trying to help them... As am I. I guess there may be different views on when the difference between impossible-in-principle and feasible-only-with-more-resources is important. -- **************************************************************** * C. M. Sperberg-McQueen, Black Mesa Technologies LLC * http://www.blackmesatech.com * http://cmsmcq.com/mib * http://balisage.net ****************************************************************
Received on Thursday, 18 October 2012 16:50:45 UTC