Introduction to Talking Robots

Size: px

Start display at page:

Download "Introduction to Talking Robots"

Griselda Fox
6 years ago
Views:

1 Introduction to Talking Robots Graham Wilcock Adjunct Professor, Docent Emeritus University of Helsinki

2 Robots and Artificial Intelligence Graham Wilcock

3 Breakthrough Steps of Artificial Intelligence 1950s: Turing Test (defining what is AI) 1960s: ELIZA (dialogues that seem human-like) 1970s: SHRDLU (understanding a small domain) 1980s: CHAT-80 (database + logical inferencing) 1990s: Deep Blue (chess equalling best humans) 2000s: IBM Watson (learning knowledge from texts)

4 Alan Turing ( ) Father of Computer Science Cambridge ( ) Mathematics Theory of Computability Bletchley Park ( ) Cryptography Code-breaking machines Manchester ( ) Computer Science Concept of Artificial Intelligence

5 Wittgenstein, Turing, von Wright at University of Cambridge Foundations of Mathematics: Formal logic Whitehead and Russell Principia Mathematica ( ) Wittgenstein Tractatus Logico-Philosophicus ( ) Turing On Computable Numbers (1936): Turing machines Wittgenstein lectures (1939): Logic and language Turing and G H von Wright attended: Turing disagreed von Wright elected Professor after Wittgenstein (1948) Wittgenstein Philosophical Investigations (1953)

6 Wittgenstein, Turing, von Wright during World War II Wittgenstein Worked unknown in London as hospital porter Turing Worked secretly at Bletchley Park as cryptanalyst von Wright Lecturer at University of Helsinki (Professor 1946)

7 Bletchley Park Totally secret until 1974 Listen, decode, analyse Receive and transcribe coded German messages Break codes as soon as possible Interpret significance of messages Code breaking Too many millions of possible combinations Small help from inspired guesses, lucky clues Had to invent automatic computing machines Chess masters (all my UK chess heroes were there)

8 University of Manchester First stored-program computer Alan Turing (briefly at National Physical Laboratory) Detailed design for a stored-program computer (1946) Based on his concept of Turing machines (1936) Freddie Williams and Tom Kilburn (U of Manchester) Built a working stored-program computer First successful stored-program demo (1948) Turing moved to Manchester Reader in Mathematics Department (1948) Deputy Director of Computing Laboratory (no Director)

9 University of Manchester Growth of Computer Science Tom Kilburn First successful stored-program demo (1948) First Professor of new Computer Science (1964) Re-enacted demo at 50th anniversary (1998) Alan Turing Worked on Manchester Mark 1 computer ( ) (Generations of Manchester computers developed by ICL) Computing Machinery and Intelligence (1950): Proposed a test for artificial intelligence: Turing Test

Turing Test (1950) Tests if a machine is intelligent The "standard interpretation" of the Turing Test, in which player C, the interrogator, is given the task of trying to determine

10 Turing Test (1950) Tests if a machine is intelligent The "standard interpretation" of the Turing Test, in which player C, the interrogator, is given the task of trying to determine which player A or B is a computer and which is a human. The interrogator is limited to using the responses to written questions to make the determination. (Wikipedia)

11 ELIZA (1966) Almost passed Turing Test Dialogue responses in style of a psychotherapist How does that make you feel? Tell me more. Able to keep sympathetic dialogue going indefinitely Many users thought the replies were by a human No factual knowledge or language understanding ELIZA - A Computer Program For the Study of Natural Language Communication Between Man And Machine Joseph Weizenbaum (1966)

12 SHRDLU (1972) Understanding in blocks world Robot and Artificial Intelligence Simulated robot arm moves specified objects Find a block which is taller than the one you are holding and put it into the box Understands natural language Complex referring expressions, explains its decisions Very restricted domain (shapes, sizes, colours) Understanding Natural Language Terry Winograd (1972)

13 CHAT-80 (1982) QA by logical inferences Question Answering (QA) system Logic-based programming in Prolog Separates domain + processing Database of geographical facts (could be changed) population(finland, 5.0), capital(finland, helsinki) Performs logical inferences to find answer Derives new facts (not stated in database) if needed CHAT-80 Warren & Pereira (1982)

14 IBM Watson (2000s) QA by learning from texts Question Answering (QA) system Learns knowledge from massive amounts of texts Beat humans in Jeopardy! competition (2011) Uses UIMA (formerly IBM, now open source) Unstructured Information Management Architecture IBM UIMA Innovation Award (2008): G Wilcock Performs multi-level analyses to extract information Part-of-speech tagging, phrase chunking, named entity recognition, syntactic parsing, relation extraction,

15 Breakthrough Steps of Artificial Intelligence 1950s: Turing Test (defining what is AI) 1960s: ELIZA (dialogues that seem human-like) 1970s: SHRDLU (understanding a small domain) 1980s: CHAT-80 (database + logical inferencing) 1990s: Deep Blue (chess equalling best humans) 2000s: IBM Watson (learning knowledge from texts)

16 Robots and Artificial Intelligence Robots and Dogs CogInfoCom 2011, Budapest

What is Artificial Intelligence? Alternate Definitions (Russell + Norvig) Human intelligence

What is Artificial Intelligence? Alternate Definitions (Russell + Norvig) Human intelligence CSE 3401: Intro to Artificial Intelligence & Logic Programming Introduction Required Readings: Russell & Norvig Chapters 1 & 2. Lecture slides adapted from those of Fahiem Bacchus. What is AI? What is