1 / 26

G5AIAI Introduction to Artificial Intelligence

G5AIAI Introduction to Artificial Intelligence. History. Graham Kendall. 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

karif
Télécharger la présentation

G5AIAI Introduction to Artificial Intelligence

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. G5AIAIIntroduction to Artificial Intelligence History Graham Kendall

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

  3. Why do we need AI anyway?

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

  5. 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)

  6. Combinatorial Explosion - Towers of Hanoi

  7. Combinatorial Explosion - Towers of Hanoi

  8. Combinatorial Explosion - Towers of Hanoi

  9. Combinatorial Explosion - Towers of Hanoi

  10. Combinatorial Explosion - Towers of Hanoi

  11. Combinatorial Explosion - Towers of Hanoi

  12. Combinatorial Explosion - Towers of Hanoi

  13. Combinatorial Explosion - Towers of Hanoi

  14. 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?

  15. 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!!!!

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

  17. Microseconds since Big Bang Microseconds in a Day Combinatorial Explosion

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

  19. Alan Turing • Founder of computer science, mathematician, philosopher and code breaker

  20. Alan Turing • 1939-40 Devises the Bombe, machine for Enigma decryption • 1947-48: Papers on programming, neural nets, and prospects for artificial intelligence • 1948: Manchester University • 1950: Philosophical paper on machine intelligence: the Turing Test • 1954 (7 June): Death by cyanide poisoning, Wilmslow, Cheshire • 1912 (23 June): Birth, Paddington, London • 1931-34: Undergraduate at King's College, Cambridge University • 1935: Elected fellow of King's College, Cambridge • 1936: The Turing machine: On Computable Numbers... Submitted • 1936-38: At Princeton University. Ph.D. Papers in logic, algebra, number theory • 1938-39: Return to Cambridge. Introduced to German Enigma cipher problem

  21. The Turing Test • Proposed by Alan Turing in 1950 • Suggested as a way of saying when we could consider computers to be intelligent • You need to read and understand The Turing Test

  22. The Chinese Room • If the Turing Test was passed Turing would conclude that the machine was intelligent • In 1980 John Searle devised a thought experiment which he called the Chinese Room (Searle, 1980) • Searle, J.R. 1980. Minds, brains and programs. Behavioural and Brain Sciences, 3: 417-457, 1980

  23. The Chinese Room • You need to read and understand the Chinese Room • You need to be able to have an opinion about The Turing Test and Chinese Room

  24. Landmarks in AI • Physical Symbol System Hypothesis • ELIZA (A Therapist) • MYCIN (First Expert System) • Means End Analysis (Exploits Forward and Backwards Chaining)

  25. Summary • Understand what is meant by combinatorial explosion (esp. wrt TSP). • The Turing Test (Read the paper) • The Chinese Room (Read the paper) • Be able to recognise the relationship between The Turing Test and The Chinese Room • Landmarks in AI History • Read Chapter 1 of AIMA

More Related