2024/01/31

That SQL implementations with recursive CTEs are Turing-complete! It makes sense: recursion and conditionals are all that is required for Turing completeness.

See https://learnsql.com/blog/sql-subquery-cte-difference/