22 ms·
> Except SQL. Actually, SQL2008 is Turing-complete! See (if HN doesn't mangle the link): http://assets.en.oreilly.com/1/event/27/High%20Performance%20SQL%20wit
by gjm11 16y ago
> Except SQL.
Actually, SQL2008 is Turing-complete! See (if HN doesn't mangle the link): http://assets.en.oreilly.com/1/event/27/High%20Performance%20SQL%20with%20PostgreSQL%20Presentation.pdf http://assets.en.oreilly.com/1/event/27/High%20Performance%2...
- zeteo 16y agoOuch. That kind of sucks, actually. IIRC, Turing incompleteness had some nice side effects for SQL - such as guaranteeing program halt, and allowing perfect automatic optimization.
- dagheti 16y agoAt least most of the time people stick to the Turing incomplete subset of the language.
- kenjackson 16y agoBeing Turing Incomplete doesn't mean that programs are guaranteed to not halt. It just means that the Halting Problem may not be undecidable for that class of programs/machines. I'd be surprised if that was useful in the real world.