1 / 5

Artificial Intelligence: Introduction

Dive into the captivating realm of AI through this comprehensive introduction covering acting humanly, thinking rationally, and AI fundamentals such as machine learning, natural language processing, and automated reasoning. Explore the intricate facets of AI with insights from cognitive science and formal logic.

tibor
Télécharger la présentation

Artificial Intelligence: Introduction

An Image/Link below is provided (as is) to download presentation Download Policy: Content on the Website is provided to you AS IS for your information and personal use and may not be sold / licensed / shared on other websites without getting consent from its author. Content is provided to you AS IS for your information and personal use only. Download presentation by click this link. While downloading, if for some reason you are not able to download a presentation, the publisher may have deleted the file from their server. During download, if you can't get a presentation, the file might be deleted by the publisher.

E N D

Presentation Transcript

  1. Artificial Intelligence: Introduction Department of Computer Science & Engineering Indian Institute of Technology Kharagpur

  2. 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

  3. 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

  4. Fundamentals • 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 function • This is the accepted definition of computability • The notion of intractability • NP-completeness • Reduction

  5. Course Outline • Problem solving by search • State space search, Problem reduction search, Game playing • Logic and deduction • First-order logic, Temporal logic, Deduction • Planning • Reasoning under Uncertainty • Learning • Additional Topics

More Related