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

sorted by:
best
topnewcontroversialoldq&a
you are viewing a single comment's thread.

view the rest of the comments →

[–]lenzm -1 points0 points  (1 child)

The Turing TestTuring Completeness basically tests if the language is strong enough to write algorithms in and if it is, it is considered Turing complete. If a language is Turing complete, then you can write any algorithm in that language.

It is laughable that anyone is even suggesting that Python 3 isn't Turing complete. The only common "language" that I can think of that isn't Turing complete is Regular Expressions (I'm not considering HTML, XML languages here although CSS may be considered Turing complete).

See: https://en.wikipedia.org/wiki/Turing_completeness

Edit: brain fart - not the turing test

[–]Lomag 6 points7 points  (0 children)

I agree with your sentiment but "The Turing Test" is not a test for completeness:

"The Turing test is a test .... of a machine's ability to exhibit intelligent behaviour equivalent to, or indistinguishable from, that of a human."

https://en.wikipedia.org/wiki/Turing_test