MCS 380/590 Intro to Artificial Intelligence William C. Regli Geometric and Intelligent Computing Laboratory Department of Mathematics and Computer Science.

Slides:



Advertisements
Similar presentations
Artificial Intelligence
Advertisements

Data on Trial: Lessons from The Turing Test Minds & Machines.
Philosophy and Cogsci The Turing Test Joe Lau. Alan Turing ( ) n Famous British mathematician / logician n Mathematical theory of computation.
Minds and Machines Introduction to Philosophy ; Phil 11 Rasmus Grønfeldt Winther November 18, 2014.
Artificial intelligence. I believe that in about fifty years' time it will be possible, to programme computers, with a storage capacity of about 10.
Approaches to AI. Robotics Versus Artificial Intelligence.
CS 357 – Intro to Artificial Intelligence  Learn about AI, search techniques, planning, optimization of choice, logic, Bayesian probability theory, learning,
Acting Humanly: The Turing test (1950) “Computing machinery and intelligence”:   Can machine’s think? or Can machines behave intelligently? An operational.
CS 331 / CMPE 334 – Intro to AI CS 531 / CMPE AI Course Outline.
© 2002 Franz J. Kurfess Introduction 1 CPE/CSC 481: Knowledge-Based Systems Dr. Franz J. Kurfess Computer Science Department Cal Poly.
© 2001 Franz J. Kurfess Introduction 1 CPE/CSC 580: Knowledge Management Dr. Franz J. Kurfess Computer Science Department Cal Poly.
COMP 3009 Introduction to AI Dr Eleni Mangina
CSE 471/598,CBS598 Introduction to Artificial Intelligence Fall 2004
CS : Artificial Intelligence: Representation and Problem Solving Fall 2002 Prof. Tuomas Sandholm Computer Science Department Carnegie Mellon University.
© 2001 Franz J. Kurfess Introduction 1 CPE/CSC 580: Knowledge Management Dr. Franz J. Kurfess Computer Science Department Cal Poly.
Fall 2004 Cognitive Science 207 Introduction to Cognitive Modeling Praveen Paritosh.
Artificial intelligence. [I]f there had been such machines, possessing the organs and outward form of a monkey or some other animal without reason,
Artificial Intelligence
INSTRUCTOR: DR. XENIA MOUNTROUIDOU CS CS Artificial Intelligence.
ARTIFICIAL INTELLIGENCE Introduction: Chapter Textbook: S. Russell and P. Norvig Artificial Intelligence: A Modern Approach Prentice Hall, 2003,
Artificial Intelligence
CPSC 171 Artificial Intelligence Read Chapter 14.
FOUNDATIONS OF ARTIFICIAL INTELLIGENCE Introduction: Chapter 1.
1 Intelligent Systems Q: Where to start? A: At the beginning (1940) by Denis Riordan Reference Modern Artificial Intelligence began in the middle of the.
Artificial Intelligence Introduction (2). What is Artificial Intelligence ?  making computers that think?  the automation of activities we associate.
Introduction: Chapter 1
Artificial Intelligence Lecture No. 3
The Turing Test. 2 In the beginning…  In 1950 Alan Turing wrote a paper titled Computing Machinery And Intelligence, in which he proposed to consider.
CS 103 Discrete Structures Lecture 01 Introduction to the Course
CMSC 671 Principles of Artificial Intelligence Course Overview Fall 2015.
Artificial Intelligence Tarik Booker. What we will cover… History Artificial Intelligence as Representation and Search Languages used in Artificial Intelligence.
Siposs Arnold Konrad Artificial Intelligence Coordonator: Mr. Dr. Z. Pólkowski Turing Test.
Overall course structure AI Artificial Intelligence ( A modern approach ) AI-2 Spring semester TDT4171 Methods in artificial intelligence AI-1 Fall semester.
CMSC 671 Introduction to Artificial Intelligence Course Overview Fall 2012.
Assoc. Prof. Abdulwahab AlSammak. Course Information Course Title: Artificial Intelligence Instructor : Assoc. Prof. Abdulwahab AlSammak
Philosophy 4610 Philosophy of Mind Week 8: Can a Computer Think?
Introduction to Artificial Intelligence Mitch Marcus CIS391 Fall, 2008.
Artificial Intelligence: Introduction Department of Computer Science & Engineering Indian Institute of Technology Kharagpur.
The Turing Test Minds & Machines. Alan Turing British mathematician known for: –Turing Machines (1936) –Breaking German Enigma (WWII) –Turing Test (1950)
Artificial Intelligence
The argument from reason. leibniz’s law arguments 1)All Fs are G. 2)o is not G. 3)o is not an F.
The Imitation Game INST 4200 David J Stucki Spring 2015.
CSE 471/598 Introduction to Artificial Intelligence Fall 2002.
Philosophy 1050: Introduction to Philosophy Week 12: “Thinking Machines”: Artificial Intelligence and Human Minds.
Artificial Intelligence Lecture 2 Department of Computer Science, International Islamic University Islamabad, Pakistan.
A Brief History of AI Fall 2013 COMP3710 Artificial Intelligence Computing Science Thompson Rivers University.
Philosophy 1050: Introduction to Philosophy Week 13: AI in the Real World and Review.
1 ARTIFICIAL INTELLIGENCE Gilles BÉZARD Version 3.16.
CITS4211 Artificial Intelligence Semester 1, 2013 A/Prof Lyndon While School of Computer Science & Software Engineering The University of Western Australia.
CMPT 463 Artificial Intelligence Instructor: Tina Tian.
The Chinese Room Argument. I believe that in about fifty years' time it will be possible, to programme computers… to make them play the imitation game.
What is Artificial Intelligence? Introduction to Artificial Intelligence Week 2, Semester 1 Jim Smith.
Introduction to Artificial Intelligence Heshaam Faili University of Tehran.
INST 4200 David J Stucki Spring 2015
Artificial Minds?.
CSC 290 Introduction to Artificial Intelligence
The Turing Test Minds & Machines.
CSC 361 Artificial Intelligence
Artificial Intelligence (CS 461D)
Artificial Intelligence (CS 370D)
COMP 4640 Intelligent & Interactive Systems
CS 380: Artificial Intelligence
The Turing Test Minds & Machines.
TA : Mubarakah Otbi, Duaa al Ofi , Huda al Hakami
EA C461 – Artificial Intelligence Introduction
Introduction to Artificial Intelligence – CS364
CS 404 Artificial Intelligence
COMP3710 Artificial Intelligence Thompson Rivers University
CMPT 420 / CMPG 720 Artificial Intelligence
Presentation transcript:

MCS 380/590 Intro to Artificial Intelligence William C. Regli Geometric and Intelligent Computing Laboratory Department of Mathematics and Computer Science Drexel University

What is Artificial Intelligence?

Alan M.Turing ( ) Computing machinery and intelligence. Mind, Vol. LIX , 1950 Computers will be intelligent. Debate then and now: –Will this just be a symbiotic relationship ( computer as tool) ? –Or will computers be “conscious”?

The Turing Test Imitation Game: –Judge, man, and a woman –All chat via . –Man pretends to be a woman. –Man lies, woman tries to help judge. –Judge must identify man after 5 minutes. 2.Turing Test –Replace man or woman with a computer. –Fool judge 30% of the time.

What Turing Said “I believe that in about fifty years' time it will be possible, to programme computers, with a storage capacity of about 10 9, to make them play the imitation game so well that an average interrogator will not have more than 70 per cent chance of making the right identification after five minutes of questioning. The original question, "Can machines think?" I believe to be too meaningless to deserve discussion. Nevertheless I believe that at the end of the century the use of words and general educated opinion will have altered so much that one will be able to speak of machines thinking without expecting to be contradicted.” Alan M.Turing, 1950 “Computing machinery and intelligence.” Mind, Vol. LIX

About the Class…

Textbooks Russell and Norvig, Artificial Intelligence: A Modern Approach, the Prentice Hall Series in Artificial Intelligence. ISBN Paul Graham, ANSI Common LISP, Prentice Hall, ISBN

Course Contents Search Knowledge Representation Logical Reasoning Planning Symbolic Computation and The Lisp Language

Pre-Requisites MCS 260: Data Structures MCS 360: Programming Languages Programming proficiency: C/C++ & Java Ability to do proofs (180/270) and reason with discrete mathematics (sets, graphs, nodes, functions, relations, etc)

Workload and Grading Assignments every week –programming and/or written, 8-9 total Plan on 10hrs/week outside of class Breakdown –40% exams –30% programming –30% homework Note the “Failure Policy” in syllabus No late assignments or makeups

Some Regli History (97-01) Most common grade: A 27% drop rate Reasons? –“too much work…” –Lisp F’s: see Failure Policy Course Alumni now at –CMU, CalTech, NEC A 32% B 30% C 17% D 8% F 13%

Questions?