4 ms·
SQL with recursive CTEs is Turing-complete. So nothing stops you from writing compilers, rendering Mandelbrot fractals, parsing text, and training neural networ
by MichaelBurge 3y ago
SQL with recursive CTEs is Turing-complete. So nothing stops you from writing compilers, rendering Mandelbrot fractals, parsing text, and training neural networks in SQL.
- e12e 3y ago> nothing stops you But ergonomics of the syntax certainly hinders you ...