Download Artificial Intelligence: Introduction

yes no Was this document useful for you?
   Thank you for your participation!

* Your assessment is very important for improving the workof artificial intelligence, which forms the content of this project

Document related concepts

Turing machine wikipedia , lookup

Interpretation (logic) wikipedia , lookup

Computer vision wikipedia , lookup

Embodied cognitive science wikipedia , lookup

Knowledge representation and reasoning wikipedia , lookup

Existential risk from artificial general intelligence wikipedia , lookup

Natural computing wikipedia , lookup

Algorithm wikipedia , lookup

Artificial general intelligence wikipedia , lookup

Computer Go wikipedia , lookup

Donald Bren School of Information and Computer Sciences wikipedia , lookup

William Clancey wikipedia , lookup

Theoretical computer science wikipedia , lookup

Artificial intelligence wikipedia , lookup

Philosophy of artificial intelligence wikipedia , lookup

History of the Church–Turing thesis wikipedia , lookup

Artificial Intelligence: Introduction
Department of Computer Science & Engineering
Indian Institute of Technology Kharagpur
What is AI?
• Acting humanly
– Turing Test (1950)
• The computer is interrogated by a human via a teletype
• It passes if the human cannot tell if there is a computer or
human at the other end
Natural Language Processing
Knowledge Representation
Automated Reasoning
Machine Learning
Computer vision and Robotics
CSE, IIT Kharagpur
What is AI?
• Thinking humanly
– Cognitive Science
• The study of how we do what we do
• How to make the computer do it in the same way
• Thinking rationally
– Formal Logic
CSE, IIT Kharagpur
• The notion of expressing computation as an algorithm
• Godel’s Incompleteness Theorem (1931):
– In any language expressive enough to describe the properties of
natural numbers, there are true statements that are undecidable:
that is, their truth cannot be established by any algorithm.
• Church-Turing Thesis (1936):
– The Turing machine is capable of computing any computable
– This is the accepted definition of computability
• The notion of intractability
– NP-completeness
– Reduction
CSE, IIT Kharagpur
Course Outline
• Problem solving by search
– State space search, Problem reduction search, Game playing
• Logic and deduction
– First-order logic, Temporal logic, Deduction
Reasoning under Uncertainty
Additional Topics
CSE, IIT Kharagpur