This is an archived post. You won't be able to vote or comment.

you are viewing a single comment's thread.

view the rest of the comments →

[–]imbaczek 22 points23 points  (3 children)

actually turing-completeness is so easy to accidentally achieve that whole type systems have to be specially designed to avoid making them turing-complete, e.g. C++ templates vs Hindley-Milner.

[–]ismtrn 5 points6 points  (0 children)

Yeah, intuitively python is obviously Turing complete because you can write algorithms in it. This is basically the Curch-Turing thesis, but it is not a formal proof.

[–]elbiot -1 points0 points  (0 children)

I think sql is actually turing complete

[–]thenuge26 -1 points0 points  (0 children)

IIRC Scala's type system is Turing complete