Interesting. SQL has been Turing complete since PSM was added to the 1992 standard. (Not SQLite). I guess they mean "Turing complete with respect to the relation datatype".
Andl already supports windowing (but not on SQLite). The Andl implementation of recursion queries is nearly done. I read the paper. It should provide a good source of sample queries for Andl. However, I was not impressed by the "proof". Maybe you had to be there. Regards David M Bennett FACS Andl - A New Database Language - andl.org -----Original Message----- From: sqlite-users-boun...@mailinglists.sqlite.org [mailto:sqlite-users-bounces at mailinglists.sqlite.org] On Behalf Of Igor Tandetnik Sent: Friday, 12 June 2015 1:49 PM To: sqlite-users at mailinglists.sqlite.org Subject: Re: [sqlite] Is recursive CTE fully capable? On 6/11/2015 8:08 PM, david at andl.org wrote: > The question I'm trying to ask is whether recursive CTE (either as > defined in the standard or as implemented in SQLite) carries the full > capability of evaluating recursive queries on appropriate data > structures, or are there queries that are beyond what it can do? http://assets.en.oreilly.com/1/event/27/High%20Performance%20SQL%20with%20Po stgreSQL%20Presentation.pdf "With CTE and Windowing, SQL is Turing Complete." -- Igor Tandetnik _______________________________________________ sqlite-users mailing list sqlite-users at mailinglists.sqlite.org http://mailinglists.sqlite.org/cgi-bin/mailman/listinfo/sqlite-users
