G5BAIM Artificial Intelligence Methods

Slides:



Advertisements
Similar presentations
Heuristic Search techniques
Advertisements

State Space Representation and Search
Lecture 24 Coping with NPC and Unsolvable problems. When a problem is unsolvable, that's generally very bad news: it means there is no general algorithm.
Lecture # 38 Algorithms & Problem Solving: How Hard Can it Get?
Part2 AI as Representation and Search
Chapter 6: The physical symbol system hypothesis
 The amount of time it takes a computer to solve a particular problem depends on:  The hardware capabilities of the computer  The efficiency of the.
An Introduction to Artificial Intelligence. Introduction Getting machines to “think”. Imitation game and the Turing test. Chinese room test. Key processes.
CS440/ECE448: Artificial Intelligence
CSCE101 –Chapter 8 (continued) Tuesday, December 5, 2006.
The Future of Artificial Intelligence John Paxton Montana State University August 14, 2003.
TK3043 Analysis and Design of Algorithms Introduction to Algorithms.
Dr Rong Qu History of AI.  AI ◦ Originated in 1956, John McCarthy coined the term ◦ very successful at early stage  “Within 10 years a computer will.
Reference: "Artificial Intelligence, a Modern Approach, 3rd ed."
Copyright R. Weber Search in Problem Solving Search in Problem Solving INFO 629 Dr. R. Weber.
Towers of Hanoi. Introduction This problem is discussed in many maths texts, And in computer science an AI as an illustration of recursion and problem.
19/13/2015CS360 AI & Robotics CS360: AI & Robotics TTh 9:25 am - 10:40 am Shereen Khoja
Artificial Intelligence LECTURE 3 ARTIFICIAL INTELLIGENCE LECTURES BY ENGR. QAZI ZIA 1.
CNS 4470 Artificial Intelligence. What is AI? No really what is it? No really what is it?
1 Artificial Intelligence Introduction. 2 What is AI? Various definitions: Building intelligent entities. Getting computers to do tasks which require.
1 CO Games Development 1 Week 11 Search Methods Gareth Bellaby.
Unsolvability and Infeasibility. Computability (Solvable) A problem is computable if it is possible to write a computer program to solve it. Can all problems.
Complexity A decidable problem is computationally solvable. But what resources are needed to solve the problem? –How much time will it require? –How much.
G5BAIM Artificial Intelligence Methods Graham Kendall History.
Artificial Intelligence: Introduction Department of Computer Science & Engineering Indian Institute of Technology Kharagpur.
So what is AI?.
Introduction to Genetic Algorithms. Genetic Algorithms We’ve covered enough material that we can write programs that use genetic algorithms! –More advanced.
Definitions of AI There are as many definitions as there are practitioners. How would you define it? What is important for a system to be intelligent?
Graham Kendall +44 (0) G5AIAI Introduction to AI Graham Kendall Combinatorial Explosion.
Lecture # 39 What Can’t Be Computed?. Computability Tractable problems (P): Can be solved by a a computer is some deterministic (reasonable) polynomial.
SNU OOPSLA Lab. 1 Great Ideas of CS with Java Part 1 WWW & Computer programming in the language Java Ch 1: The World Wide Web Ch 2: Watch out: Here comes.
Complexity & Computability. Limitations of computer science  Major reasons useful calculations cannot be done:  execution time of program is too long.
Analysis of the Traveling Salesman Problem and current approaches for solving it. Rishi B. Jethwa and Mayank Agarwal. CSE Department. University of Texas.
G5BAIM Artificial Intelligence Methods Dr. Graham Kendall Course Introduction.
Data Structures, Algorithms & Complexity
Chapter VI What should I know about the sizes and speeds of computers?
The Turing Test: the first 50 years Robert M. French Trends in Cognitive Science, Vol. 4, No. 3, March 2000 Summarized by Eun Seok Lee BI
A Brief History of AI Fall 2013 COMP3710 Artificial Intelligence Computing Science Thompson Rivers University.
Uses and Limitations Fall 2013 COMP3710 Artificial Intelligence Computing Science Thompson Rivers University.
CS440/ECE448: Artificial Intelligence. Section Q course website:
Tower of Hanoi problem: Move the pile of rings from one peg to another
CS1022 Computer Programming & Principles
Recursion.
COMP3710 Artificial Intelligence Thompson Rivers University
Chapter 1 Introduction Copyright © 2007 Pearson Addison-Wesley. All rights reserved.
Done Done Course Overview What is AI? What are the Major Challenges?
Here is a puzzle I found on a t-shirt
G5BAIM Artificial Intelligence Methods
Course Instructor: knza ch
Artificial Intelligence (Lecture 1)
Genetic Algorithms CSCI-2300 Introduction to Algorithms
Java Coding 6-extra David Davenport Computer Eng. Dept.,
Tower of Hanoi problem: Move the pile of rings from one peg to another
4. Computational Problem Solving
3. Brute Force Selection sort Brute-Force string matching
Dr. Unnikrishnan P.C. Professor, EEE
Branch and Bound Searching Strategies
Lecture 6 Architecture Algorithm Defin ition. Algorithm 1stDefinition: Sequence of steps that can be taken to solve a problem 2ndDefinition: The step.
3. Brute Force Selection sort Brute-Force string matching
Knowledge Representation
COMP3710 Artificial Intelligence Thompson Rivers University
Artificial Intelligence CIS 342
Combinatorial Explosion
COMP3710 Artificial Intelligence Thompson Rivers University
Tower of Hanoi problem: Move the pile of rings from one peg to another
David Kauchak CS51A – Spring 2019
Algorithms CSCI 235, Spring 2019 Lecture 36 P vs
Chapter 1 Introduction Copyright © 2007 Pearson Addison-Wesley. All rights reserved.
3. Brute Force Selection sort Brute-Force string matching
Presentation transcript:

G5BAIM Artificial Intelligence Methods Graham Kendall History

“Within 10 years a computer will be a chess champion” Predictions “Within 10 years a computer will be a chess champion” Herbert Simon, 1958 Conversion from Russian to English, when presented with “The spirit is willing but the flesh is weak” produced “The vodka is good but the meat is rotten” National Research Council, 1957

The Travelling Salesman Problem A salesperson has to visit a number of cities (S)He can start at any city and must finish at that same city The salesperson must visit each city only once The number of possible routes is (n!)/2

Combinatorial Explosion

Combinatorial Explosion

Combinatorial Explosion A 10 city TSP has 181,000 possible solutions A 20 city TSP has 10,000,000,000,000,000 possible solutions A 50 City TSP has 100,000,000,000,000,000,000,000,000,000,000,000,000,000,000,000,000,000,000,000,000 possible solutions There are 1,000,000,000,000,000,000,000 litres of water on the planet Mchalewicz, Z, Evolutionary Algorithms for Constrained Optimization Problems, CEC 2000 (Tutorial)

Combinatorial Explosion - Towers of Hanoi

Combinatorial Explosion - Towers of Hanoi

Combinatorial Explosion - Towers of Hanoi

Combinatorial Explosion - Towers of Hanoi

Combinatorial Explosion - Towers of Hanoi

Combinatorial Explosion - Towers of Hanoi

Combinatorial Explosion - Towers of Hanoi

Combinatorial Explosion - Towers of Hanoi

Combinatorial Explosion - Towers of Hanoi How many moves does it take to move four rings? You might like to try writing a towers of hanoi program (and you may well have to in one of your courses!)

Combinatorial Explosion - Towers of Hanoi If you are interested in an algorithm here is a very simple one Assume the pegs are arranged in a circle 1. Do the following until 1.2 cannot be done 1.1 Move the smallest ring to the peg residing next to it, in clockwise order 1.2 Make the only legal move that does not involve the smallest ring 2. Stop P. Buneman and L.Levy (1980). The Towers of Hanoi Problem, Information Processing Letters, 10, 243-4

Combinatorial Explosion - Towers of Hanoi A time analysis of the problem shows that the lower bound for the number of moves is 2N-1 Since N appears as the exponent we have an exponential function

Combinatorial Explosion - Towers of Hanoi

Combinatorial Explosion - Towers of Hanoi The original problem was stated that a group of tibetan monks had to move 64 gold rings which were placed on diamond pegs. When they finished this task the world would end. Assume they could move one ring every second (or more realistically every five seconds). How long till the end of the world?

Combinatorial Explosion - Towers of Hanoi > 500,000 years!!!!! Or 3 Trillion years Using a computer we could do many more moves than one second so go and try implementing the 64 rings towers of hanoi problem. If you are still alive at the end, try 1,000 rings!!!!

Combinatorial Explosion - Optimization Optimize f(x1, x2,…, x100) where f is complex and xi is 0 or 1 The size of the search space is 2100  1030 An exhaustive search is not an option At 1000 evaluations per second Start the algorithm at the time the universe was created As of now we would have considered 1% of all possible solutions

Combinatorial Explosion Microseconds since Big Bang Microseconds in a Day

Combinatorial Explosion Running on a computer capable of 1 million instructions/second 10 20 50 100 200 N2 N5 1/10,000 second 1/2500 second 1/400 second 1/100 second 1/25 second 1/10 second 3.2 seconds 5.2 minutes 2.8 hours 3.7 days 2N NN 1/1000 second 1 second 35.7 years > 400 trillion centuries 45 digit no. of centuries 2.8 hours 3.3 trillion years 70 digit no. of centuries 185 digit no. of centuries 445 digit no. of centuries Ref : Harel, D. 2000. Computer Ltd. : What they really can’t do, Oxford University Press

Definition of AI Systems that think like humans Systems that think rationally Systems that act like humans Systems that act rationally

Definition of AI Systems that think like humans Systems that think rationally Systems that act like humans Systems that act rationally Top Left = Cognitive Science

Definition of AI Systems that think like humans Systems that think rationally Systems that act like humans Systems that act rationally Top Left = Cognitive Science Bottom Left = The Turing Test

Definition of AI Systems that think like humans Systems that think rationally Systems that act like humans Systems that act rationally Top Left = Cognitive Science Bottom Left = The Turing Test Top Right = Logical Approach

Definition of AI Systems that think like humans Systems that think rationally Systems that act like humans Systems that act rationally Top Left = Cognitive Science Bottom Left = The Turing Test Top Right = Logical Approach Bottom Right = Acting to achieve one’s goals

Definition of AI Systems that think like humans Systems that think rationally Systems that act like humans Systems that act rationally Top = Thought Processes and Reasoning

Definition of AI Systems that think like humans Systems that think rationally Systems that act like humans Systems that act rationally Top = Thought Processes and Reasoning Bottom = Behaviour

Definition of AI Systems that think like humans Systems that think rationally Systems that act like humans Systems that act rationally Top = Thought Processes and Reasoning Bottom = Behaviour Left = Measure success against ourselves

Definition of AI Systems that think like humans Systems that think rationally Systems that act like humans Systems that act rationally Top = Thought Processes and Reasoning Bottom = Behaviour Left = Measure success against ourselves Right = Measure against rationality

Definition of AI Systems that think like humans Systems that think rationally Systems that act like humans Systems that act rationally

Not Examinable - but in notes Turing Test Chinese Room Physical Symbol System Hypothesis ELIZA MYCIN Forward/Backward Chaining Means End Analysis

G5BAIM Artificial Intelligence Methods Graham Kendall End of History