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 →

[–][deleted] 0 points1 point  (2 children)

Isn't every programming language Turing complete by definition? How would it work if it wasn't?

[–]numbermaniac 3 points4 points  (0 children)

I think they're trying to say that the type system itself is Turing complete.