- Foundation
- About 15 min
- 5 practice questions
What is artificial intelligence? Meaning, narrow and general AI, and a short history
Explain in plain words what AI is, tell it apart from a program that only follows fixed rules, separate narrow AI from general AI, and place the key milestones of 1950, 1956 and 1997 in order.
If something looks wrong, please tell us.
By the end of this lesson you can
- Explain in plain words what artificial intelligence is and how it differs from a program that only follows fixed rules.
- Tell narrow (weak) AI apart from general (strong) AI, with everyday examples of narrow AI.
- Place three milestones in order: Turing's 1950 paper, the 1956 Dartmouth workshop and Deep Blue's 1997 win.
Artificial Intelligence, or AI, is no longer a topic only for scientists. It appears in general-studies and computer-awareness papers, and you meet it every day in maps, spam filters and video suggestions. This lesson builds the base: what AI means, how it differs from an ordinary program, the two kinds of AI, and the dates every aspirant should know.
Intelligence in a machine
Artificial intelligence is the branch of computer science that builds systems able to do tasks that normally need human intelligence. Such tasks include recognising faces and voices, understanding and translating language, spotting patterns, making predictions, solving problems and learning from experience. The word artificial means made by people; the intelligence is the ability to perform these tasks, not a mind or feelings like a human's.
Programmed rules versus learning
An ordinary program follows rules that a programmer has written out completely, step by step. A calculator adds 245 and 380 by a fixed method and always gives 625. It never improves and never faces a situation its programmer did not plan for. Many AI systems work differently: instead of being told every rule, they learn patterns from examples (data) and then apply those patterns to new cases they have never seen.
| Point | Ordinary program | AI system (learning type) |
|---|---|---|
| Who decides the rules | The programmer writes every rule | The system finds patterns in example data |
| New, unplanned situations | Fails or gives an error | Makes a best guess from learned patterns |
| Gets better with more data | No | Usually yes, after retraining |
| Everyday example | Calculator, ATM PIN check | Spam filter, face unlock, song suggestions |
Narrow AI and general AI
| Type | Also called | What it can do | Does it exist? |
|---|---|---|---|
| Narrow AI | Weak AI | One task or a small set of related tasks, often very well | Yes - the AI systems in use are classed as narrow AI |
| General AI | Strong AI, AGI (Artificial General Intelligence) | Any intellectual task a human can do, and switch between them | No - it remains a research goal |
A chess program that beats champions cannot drive a car, and a face-recognition system cannot write an essay. Each is narrow AI: excellent inside its own job, helpless outside it. Whether general AI can be built is debated, so treat any claim that it already exists with caution. Narrow AI you already use:
Narrow AI vs general AI
-
Narrow AI (weak AI)
- Does one task or a small set of related tasks, often very well
- Excellent inside its own job, helpless outside it
- Exists: the AI systems in use are narrow AI
-
General AI (strong AI, AGI)
- Would do any intellectual task a human can
- Could switch between tasks
- Does not exist: it remains a research goal
- Maps - predicting travel time from traffic patterns.
- Spam filters - moving fake prize and phishing emails out of your inbox.
- Voice assistants - answering spoken questions, including in Hindi and other Indian languages.
- Recommendations - apps suggesting items from what you and similar users chose.
- Banking alerts - flagging a payment that looks unusual for your account.
A very short history
1950 - Alan Turing. The British mathematician Alan Turing, often called a father of computer science, published the paper 'Computing Machinery and Intelligence'. He replaced the hard question 'can machines think?' with a practical test, the imitation game, now called the Turing test. A human judge chats by typed messages with two hidden partners, one a person and one a machine. If the judge cannot reliably tell which is the machine, the machine is said to pass. Critics point out that imitating conversation is not the same as understanding it.
1956 - the name. The American computer scientist John McCarthy coined the term artificial intelligence in the proposal for a summer workshop at Dartmouth College in 1956. For this reason 1956 is treated as the birth year of AI as a field, and McCarthy is called one of the fathers of AI.
1997 - Deep Blue. IBM's chess computer Deep Blue beat Garry Kasparov, the reigning world champion, in a six-game match. It did not learn like modern AI; it searched huge numbers of possible moves very fast and scored positions with rules prepared with the help of chess experts.
Three milestones
- 1950 - Turing Proposes the imitation game, now called the Turing test.
- 1956 - Dartmouth John McCarthy coins the term artificial intelligence.
- 1997 - Deep Blue Beats world chess champion Garry Kasparov.
Worked example 1: is it AI?
| System | AI or not? | Reason |
|---|---|---|
| A calculator working out 245 + 380 = 625 | Not AI | Fixed arithmetic rule, no judgement or learning |
| A traffic signal that changes every 60 seconds by timer | Not AI | Fixed timer, ignores real traffic |
| A maps app predicting 6 pm travel time from Delhi to Gurugram | AI | Predicts from patterns in past and live traffic data |
| A music app suggesting songs you have never played | AI | Learns your taste from listening patterns |
Worked example 2: order and gaps
Arrange: (P) Deep Blue beats Kasparov, (Q) Turing proposes the imitation game, (R) the term AI is coined for Dartmouth. Working: Q is 1950, R is 1956, P is 1997, so the order is Q, R, P. Gaps: 1956 − 1950 = 6 years; 1997 − 1956 = 41 years; 1997 − 1950 = 47 years. The field was named 6 years after Turing's paper, but a computer beat the world chess champion only 41 years later.
AI = machines doing tasks that normally need human intelligence. Narrow (weak) AI does one job well; general (strong) AI would do any intellectual job a human can - and has not been achieved. 1950 Turing (the test) → 1956 McCarthy at Dartmouth (the name) → 1997 Deep Blue (chess).
Key takeaways: AI performs tasks that need intelligence, such as recognising, predicting and deciding. Ordinary programs follow fixed rules; learning AI finds patterns in data. Every AI in use is narrow AI; general AI (AGI) is still a goal. Remember 1950 (Turing), 1956 (McCarthy, Dartmouth) and 1997 (Deep Blue).
Check your understanding
-
1. Which statement best describes artificial intelligence?
- Any machine that runs on electricity
- A computer that stores large amounts of data
- Computer systems that perform tasks normally needing human intelligence
- A robot shaped like a human being
Show answer
Answer: C. AI is defined by the kind of task: recognising, understanding language, predicting and learning - tasks that normally need human intelligence. Storing data, using electricity or having a human shape do not make something AI.
-
2. A voice assistant can answer questions but cannot drive a car or diagnose a disease. It is an example of:
- Narrow (weak) AI
- General (strong) AI
- Artificial General Intelligence (AGI)
- A fixed-rule program with no AI
Show answer
Answer: A. It works well only in its own limited area, which is the definition of narrow or weak AI. General AI, also called strong AI or AGI, would handle any intellectual task and has not been achieved.
-
3. Who coined the term 'artificial intelligence'?
- Alan Turing
- John McCarthy
- Charles Babbage
- Garry Kasparov
Show answer
Answer: B. John McCarthy coined the term in the proposal for the 1956 Dartmouth workshop. Turing proposed the imitation game in 1950, Babbage designed early mechanical computers, and Kasparov was the chess champion beaten by Deep Blue.
-
4. In the Turing test, a machine is said to pass if:
- It solves a mathematics problem faster than a human
- It beats a human at chess
- It can see and name objects in photographs
- A human judge chatting by text cannot reliably tell it apart from a human
Show answer
Answer: D. Turing's imitation game is about conversation: a judge exchanges typed messages with a hidden human and a hidden machine. If the judge cannot reliably say which is the machine, it passes. Speed, chess and naming objects are not part of the test.
-
5. Deep Blue, which defeated Garry Kasparov in 1997, mainly worked by:
- Holding a conversation with its opponent
- Learning chess from millions of internet videos
- Searching huge numbers of possible moves fast and scoring positions with prepared rules
- Copying the moves of other human players live
Show answer
Answer: C. Deep Blue relied on very fast search of possible moves plus evaluation rules prepared with chess experts. It was not a modern learning system, and it did not converse or copy players.
Sign in to keep track of the lessons you finish.