PostgreSQL is Turing-complete, as proven by implementations of a cyclic tag system[0] and Turing machine[1]. The Mandelbrot set[2] and travelling-salesman problem[3] have also been implemented in it.
Transact-SQL is also Turing-complete, as proven by a Brainfuck implementation[4].
With that, you can theoretically compute anything :).
Transact-SQL is also Turing-complete, as proven by a Brainfuck implementation[4].
With that, you can theoretically compute anything :).
[0]: https://wiki.postgresql.org/wiki/Cyclic_Tag_System
[1]: https://blog.coelho.net/database/2013/08/17/turing-sql-1.htm...
[2]: https://wiki.postgresql.org/wiki/Mandelbrot_set
[3]: https://web.archive.org/web/20201111224603/http://assets.en....
[4]: https://stackoverflow.com/questions/900055/is-sql-or-even-ts...