5 ms·
>Sure, SQL is only educational or not programming. Last time I checked SQL was proven to be Turing-Complete? While Excel's formula language wasn't always TC,
by Jorengarenar 4y ago
>Sure, SQL is only educational or not programming.
Last time I checked SQL was proven to be Turing-Complete?
While Excel's formula language wasn't always TC, the program as a whole, I believe, was since the very beginning.
>telling a computer "if you recognize a pattern described as such, replace it with so and so", just regex with replacement, sounds very much like programming to me.
I think by adding "if X then replace" capability we already escaped outside the bounds of Type-3 grammar, i.e. it's not a regular expression anymore (despite being build upon one).
- 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.