How is Turing Test used to evaluate intelligence of a machine?

In 1950, Alan Turing introduced a test to check whether a machine can think like a human or not, this test is
known as the Turing Test. In this test, Turing proposed that the computer can be said to be an intelligent if it
can mimic human response under specific conditions.

Turing Test was introduced by Turing in his 1950 paper, "Computing Machinery and Intelligence," which
considered the question, "Can Machine think?"
The Turing test is based on a party game "Imitation game," with some modifications. This game involves
three players in which one player is Computer, another player is human responder, and the third player is a
human Interrogator, who is isolated from other two players and his job is to find that which player is machine
among two of them.
Consider, Player A is a computer, Player B is human, and Player C is an interrogator. Interrogator is aware
that one of them is machine, but he needs to identify this on the basis of questions and their responses.
The conversation between all players is via keyboard and screen so the result would not depend on the
machine's ability to convert words as speech.
The test result does not depend on each correct answer, but only how closely its responses like a human
answer. The computer is permitted to do everything possible to force a wrong identification by the
interrogator.

Features required for a machine to pass the Turing test:

• Natural language processing: NLP is required to communicate with Interrogator in general human
language like English.

• Knowledge representation: To store and retrieve information during the test.

• Automated reasoning: To use the previously stored information for answering the questions.

• Machine learning: To adapt new changes and can detect generalized patterns.

• Vision (For total Turing test):To recognize the interrogator actions and other objects during a test.

• Motor Control (For total Turing test):To act upon objects if requested.
What is an intelligent agent? With examples, explain different type of intelligent agents
Artificial intelligence is defined as the study of rational agents. A rational agent could be anything that makes
decisions, as a person, firm, machine, or software. It carries out an action with the best outcome after
considering past and current percepts(agent’s perceptual inputs at a given instance). An AI system is
composed of an agent and its environment. The agents act in their environment. The environment may
contain other agents.
An agent is anything that can be viewed as:
• perceiving its environment through sensors and

• acting upon that environment through actuators

Agents can be grouped into five classes based on their degree of perceived intelligence and capability:
• Simple Reflex Agents: The Simple reflex agents are the simplest agents. These agents take
decisions on the basis of the current percepts and ignore the rest of the percept history.
• Model-based Agents: The Model-based agent can work in a partially observable environment, and
track the situation. It consists of two important factors, which are Model and Internal State.
• Goal-based agents: The knowledge of the current state environment is not always sufficient to
decide for an agent to what to do. The agent needs to know its goal which describes desirable
situations.
• Utility-based agents: These agents are similar to the goal-based agent but provide an extra
component of utility measurement which makes them different by providing a measure of success at
a given state. Utility-based agent act based not only goals but also the best way to achieve the goal.
• Learning agents: A learning agent in AI is the type of agent which can learn from its past
experiences, or it has learning capabilities. It starts to act with basic knowledge and then able to act
and adapt automatically through learning.

Explain different types of Machine Learning algorithm

Machine learning is programming computers to optimize a performance criterion using example data or past
experience . We have a model defined up to some parameters, and learning is the execution of a computer
program to optimize the parameters of the model using the training data or past experience. The model may
be predictive to make predictions in the future, or descriptive to gain knowledge from data.
1. Supervised Machine Learning Imagine a teacher supervising a class. The teacher already knows the
correct answers but the learning process doesn’t stop until the students learn the answers as well. This is the
essence of Supervised Machine Learning Algorithms. Here, the algorithm learns from a training dataset and
makes predictions that are compared with the actual output values. If the predictions are not correct, then the
algorithm is modified until it is satisfactory. This learning process continues until the algorithm achieves the
required level of performance. Then it can provide the desired output values for any new inputs.
2. Unsupervised Machine Learning In this case, there is no teacher for the class and the students are left to
learn for themselves! So for Unsupervised Machine Learning Algorithms, there is no specific answer to be
learned and there is no teacher. In this way, the algorithm doesn’t figure out any output for input but it
explores the data. The algorithm is left unsupervised to find the underlying structure in the data in order to
learn more and more about the data itself.
3. Semi-Supervised Machine Learning The students learn both from their teacher and by themselves in Semi-
Supervised Machine Learning. And you can guess that from the name itself! This is a combination of
Supervised and Unsupervised Machine Learning that uses a little amount of labeled data like Supervised
Machine Learning and a larger amount of unlabeled data like Unsupervised Machine Learning to train the
algorithms. First, the labeled data is used to partially train the Machine Learning Algorithm, and then this
partially trained model is used to pseudo-label the rest of the unlabeled data. Finally, the Machine Learning
Algorithm is fully trained using a combination of labeled and pseudo-labeled data.

Fully observable Partially observable

An agent can always see the entire state of an An agent can never see the entire state of an
environment. environment.
EG: Chess EG: Card game
Deterministic Stochastic
An agent’s current state and selected action can A stochastic environment is random in nature and
completely determine the next stage of the cannot be determined completely by an agent.
environment.
EG: tic tac toe EG: Ludo (any games that involve dice)
Episodic Sequential
Only the current percept is required for the action. An agent requires memory of past actions to
determine the next best actions.
EG: part picking robot EG: chess
Single-agent Multi-agent
If only one agent is involved in an environment, and If multiple agents are operating in an environment,
operating by itself then such an environment is called then such an environment is called a multi-agent
single agent environment. environment.
EG: maze EG: football
Static Dynamic
The environment does not change while an agent is The environment may change over time.
acting.
EG: Crossword puzzles EG: roller coster ride, taxi driving
Discrete Continuous
The environment consists of a finite number of The environment in which the actions performed
actions that can be deliberated in the environment to cannot be numbered ie., is not discrete, is said to be
obtain the output. continuous.
EG: chess EG: self-driving cars
Known Unknown
In a known environment, the results for all the In unknown environment, agents needs to learn how
actions are known to the agent. it works in order to perform an action.
EG: card game EG: a new video game