You are aware chatbots have been “beating” the original Turing test since 2014, right?
Yes, I was in fact. Seeing where this internet argument is going, I think it’s best to leave it here.
So, in that case.
If your original chain of logic is:
1. An RL-based algorithm that could play any game could pass the turing test
2. An algorithm that can pass the Turing test is “AGI complete”, thus it is unlikely that (1) will happen soon
And you agree with the statement:
3. An algorithm did pass the Turing test in 2014
a) Have a contradiction
b) Must have some specific definition of the Turing test under which 3 is untrue (and more generally, no known algorithm can pass the Turing test)
I assume your position here is b and I’d love to hear it.
I’d also love to hear the causal reasoning behind 2. (maybe explained by your definition of the Turing test ?)
If your definitions differ from commonly accepted definitions and your you rely on causality which is not widely implied, you must at least provide your versions of the definitions and some motivation behind the causality.