Turing Test in Artificial Intelligence

The Turing test was developed by Alan Turing(A computer scientist) in 1950. He proposed
that the “Turing test is used to determine whether or not a computer(machine) can think
intelligently like humans”?
Imagine a game of three players having two humans and one computer, an interrogator(as a
human) is isolated from the other two players. The interrogator’s job is to try and figure out
which one is human and which one is a computer by asking questions from both of them. To
make things harder computer is trying to make the interrogator guess wrongly. In other words,
computers would try to be indistinguishable from humans as much as possible.
If the interrogator wouldn’t able to distinguish the answers provided by both humans and
computers then the computer passes the test and the machine(computer) is considered as
intelligent as a human. In other words, a computer would be considered intelligent if its
conversation couldn’t be easily distinguished from a human’s. The whole conversation
would be limited to a text-only channel such as a computer keyboard and screen.

There are several criticisms to this and they are:

1. Chinese Room Test by John Searle: in the year 1980, Mr. John Searle proposed the
“Chinese room argument“. He argued that the Turing test could not be used to determine
“whether or not a machine is considered as intelligent like humans”. He argued that any
machine like ELIZA and PARRY could easily pass the Turing Test simply by
manipulating symbols of which they had no understanding. Without understanding, they
could not be described as “thinking” in the same sense people do.
The Chinese room argument holds that a program cannot give a computer a
“mind”, “understanding” or “consciousness” regardless of how intelligently or
human-like the program may make the computer behave.
John imagines himself (instead of machine) as non-Chinese person sitting inside the room
isolated from another Chinese person who is outside the room tries to communicate. He
is provided a list of Chinese characters and an instruction book explaining in detail the
rules according to which strings (sequences) of characters may be formed, but without
giving the meaning of the characters. That means he has a book with an English version
of the computer program, along with sufficient paper, pencils, erasers, and filing cabinets.
Actually instruction book contains so many rules that contains input symbols and their
respective output symbol. He just need to locate the input Chinese symbol and return the
corresponding Chinese symbol as a output.
Now, the argument goes on, a computer(machine), is just like this man, in that it does
nothing more than follow the rules given in an instruction book (the program). It does not
understand the meaning of the questions given to it nor its own answers, and thus cannot
be said to be thinking. The fact is that inside person has no understanding of Chinese
language but still he manage to communicate with outside person in Chinese language
perfectly.
2. Ned Block
3. Mathematical Objections (Godel’s incompleteness theorem): His incompleteness
theorems meant there can be no mathematical theory of everything, no unification of
what’s provable and what’s true. What mathematicians can prove depends on their
starting assumptions, not on any fundamental ground truth from which all answers spring.