3 ms·
> Last time I checked SQL was proven to be Turing-Complete? Without recursive CTEs, it isn't. And there's nothing much to prove about that. Finite SQL statemen
by maweki 4y ago
> Last time I checked SQL was proven to be Turing-Complete?
Without recursive CTEs, it isn't. And there's nothing much to prove about that. Finite SQL statements on finite databases always terminate and it's therefore not computationally complete.
- Jorengarenar 4y agoIndeed, I stand corrected. Older standards of SQL show that among DSLs we can (or at least could) find non-TC programming languages in the wild.