Combinatorial explosion makes the machine impossible
Programming the machine to engage in an hour long Turing test is impossible, because it would give rise to a "combinatorial explosion". The programmer would have to code more strings than there are particles in the universe.


Argument anticipated by Ned Block, 1981.
Immediately related elementsHow this works
-
Artificial Intelligence »Artificial Intelligence
Can the Turing Test determine this? [2]  »Can the Turing Test determine this? [2] 
No: but Neo-Turing test is adequate »No: but Neo-Turing test is adequate
The Psychologism Objection »The Psychologism Objection
All Possible Conversations Machine »All Possible Conversations Machine
Combinatorial explosion makes the machine impossible
Combinatorial explosion of knowledge »Combinatorial explosion of knowledge
Machine is logically possible »Machine is logically possible
+Komentarai (1)
+Citavimą (0)
+About