SQL with CTEs Turing Complete?

From: David Fetter <david_at_fetter.org>
Date: Mon, 04 May 2009 15:13:53 -0500
Message-ID: <rdydncE0easc0WLUnZ2dnUVZ_tidnZ2d_at_speakeasy.net>


I'm curious as to SQL with Common Table Expressions is Turing Complete. Is there some kind of proof either way?

Thanks in advance for any hints, tips, pointers, etc. on this.


David Fetter <david_at_fetter.org> http://fetter.org/
Phone: +1 415 235 3778  AIM: dfetter666  Yahoo!: dfetter
Skype: davidfetter      XMPP: david.fetter_at_gmail.com

There is nothing more difficult to take in hand, more perilous to
conduct, or more uncertain in its success, than to take the lead in
the introduction of a new order of things.  Because the innovator has
for enemies all those who have done well under the old conditions, and
lukewarm defenders in those who may do well under the new.
                                                   Niccolo Machiavelli
                                                   The Prince, 1513
Received on Mon May 04 2009 - 22:13:53 CEST

Original text of this message