A.M. Turing, computer pioneer, worried about intelligence in humans & machines; proposed a test (1950) thinks with electricity

Similar documents
Progress has been tremendous. Lawrence Snyder University of Washington, Seattle

Can Computers Think? Dijkstra: Whether a computer can think is about as interesting as whether a submarine can swim. 2006, Lawrence Snyder

UNIT 13A AI: Games & Search Strategies

UNIT 13A AI: Games & Search Strategies. Announcements

AI in Tabletop Games. Team 13 Josh Charnetsky Zachary Koch CSE Professor Anita Wasilewska

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

Lecture 33: How can computation Win games against you? Chess: Mechanical Turk

Introduction and History of AI

THE AI REVOLUTION. How Artificial Intelligence is Redefining Marketing Automation

What is AI? AI is the reproduction of human reasoning and intelligent behavior by computational methods. an attempt of. Intelligent behavior Computer

Final Lecture: Fun, mainly

Quick work: Memory allocation

What is AI? Robert Platt Northeastern University

What We Talk About When We Talk About AI

CSE 40171: Artificial Intelligence. Adversarial Search: Games and Optimality

CSC384 Intro to Artificial Intelligence* *The following slides are based on Fahiem Bacchus course lecture notes.

COMP219: Artificial Intelligence. Lecture 2: AI Problems and Applications

Game Playing. Garry Kasparov and Deep Blue. 1997, GM Gabriel Schwartzman's Chess Camera, courtesy IBM.

CS343 Introduction to Artificial Intelligence Spring 2012

Artificial intelligence: past, present and future

Artificial Intelligence Search III

Thinking and Autonomy

V. Adamchik Data Structures. Game Trees. Lecture 1. Apr. 05, Plan: 1. Introduction. 2. Game of NIM. 3. Minimax

Artificial Intelligence

What's involved in Intelligence?

Introduction to Talking Robots

Thinking and Being FIT

How AI Won at Go and So What? Garry Kasparov vs. Deep Blue (1997)

Game playing. Outline

Game Playing: Adversarial Search. Chapter 5

CS 771 Artificial Intelligence. Adversarial Search

Monte Carlo Tree Search

April 25, Competing and cooperating with AI. Pantelis P. Analytis. Human behavior in Chess. Competing with AI. Cooperative machines?

COMP219: COMP219: Artificial Intelligence Artificial Intelligence Dr. Annabel Latham Lecture 12: Game Playing Overview Games and Search

Artificial Intelligence. Shobhanjana Kalita Dept. of Computer Science & Engineering Tezpur University

Game-playing AIs: Games and Adversarial Search FINAL SET (w/ pruning study examples) AIMA

CS 380: ARTIFICIAL INTELLIGENCE

CPS331 Lecture: Search in Games last revised 2/16/10

Ch.4 AI and Games. Hantao Zhang. The University of Iowa Department of Computer Science. hzhang/c145

MITOCW MIT15_071S17_Session_1.2.02_300k

Artificial Intelligence CS365. Amitabha Mukerjee

CPS331 Lecture: Agents and Robots last revised November 18, 2016

The REAL Problem With Artificial Intelligence:

MITOCW Project: Backgammon tutor MIT Multicore Programming Primer, IAP 2007

CPS 570: Artificial Intelligence Two-player, zero-sum, perfect-information Games

Foundations of AI. 6. Adversarial Search. Search Strategies for Games, Games with Chance, State of the Art. Wolfram Burgard & Bernhard Nebel

Andrei Behel AC-43И 1

Intuition Mini-Max 2

Computer Science 1400: Part #8: Where We Are: Artificial Intelligence WHAT IS ARTIFICIAL INTELLIGENCE (AI)? AI IN SOCIETY RELATING WITH AI

COMP219: Artificial Intelligence. Lecture 13: Game Playing

CS 380: ARTIFICIAL INTELLIGENCE ADVERSARIAL SEARCH. Santiago Ontañón

Artificial Intelligence. Minimax and alpha-beta pruning

Game Playing State-of-the-Art CSE 473: Artificial Intelligence Fall Deterministic Games. Zero-Sum Games 10/13/17. Adversarial Search

Foundations of AI. 5. Board Games. Search Strategies for Games, Games with Chance, State of the Art. Wolfram Burgard and Luc De Raedt SA-1

Foundations of AI. 6. Board Games. Search Strategies for Games, Games with Chance, State of the Art

Artificial Intelligence A Very Brief Overview of a Big Field

COMS 493 AI, ROBOTS & COMMUNICATION

Artificial Intelligence Adversarial Search

Foundations of Artificial Intelligence

Introduction to Computer Science with MakeCode for Minecraft

Game Playing. Dr. Richard J. Povinelli. Page 1. rev 1.1, 9/14/2003

The Roller-Coaster History of Artificial Intelligence and its Impact on the Practice of Law

Games CSE 473. Kasparov Vs. Deep Junior August 2, 2003 Match ends in a 3 / 3 tie!

Foundations of Artificial Intelligence

Creating a Poker Playing Program Using Evolutionary Computation

4/20/12. Weak AI. CS 112 Introduction to Programming. Lecture #37: AI and Future of CS. Artificial Intelligence. (Spring 2012) Zhong Shao

Logic Programming. Dr. : Mohamed Mostafa

COS 402 Machine Learning and Artificial Intelligence Fall Lecture 1: Intro

Adversarial search (game playing)

Frequently Asked Questions About the Club

Today. Types of Game. Games and Search 1/18/2010. COMP210: Artificial Intelligence. Lecture 10. Game playing

CPS331 Lecture: Agents and Robots last revised April 27, 2012

Game-playing: DeepBlue and AlphaGo

CS 112 Introduction to Programming

CS 343H: Artificial Intelligence. Week 1a: Introduction

COMP9414/ 9814/ 3411: Artificial Intelligence. Overview. UNSW c Alan Blair,

Game Playing AI. Dr. Baldassano Yu s Elite Education

Lecture 1 What is AI? EECS 348 Intro to Artificial Intelligence Doug Downey

Dr Rong Qu History of AI

Play Chess Lessons Against Computer 3d Easy

CS 188: Artificial Intelligence

Adversarial Search (Game Playing)

What's involved in Intelligence?

Outline. Game Playing. Game Problems. Game Problems. Types of games Playing a perfect game. Playing an imperfect game

Games vs. search problems. Game playing Chapter 6. Outline. Game tree (2-player, deterministic, turns) Types of games. Minimax

ARTIFICIAL INTELLIGENCE

Taffy Tangle. cpsc 231 assignment #5. Due Dates

Game playing. Chapter 6. Chapter 6 1

Game-Playing & Adversarial Search

Overview. Pre AI developments. Birth of AI, early successes. Overwhelming optimism underwhelming results

Philosophical Foundations. Artificial Intelligence Santa Clara University 2016

Game Playing AI Class 8 Ch , 5.4.1, 5.5

Game playing. Chapter 6. Chapter 6 1

6. Games. COMP9414/ 9814/ 3411: Artificial Intelligence. Outline. Mechanical Turk. Origins. origins. motivation. minimax search

SDS PODCAST EPISODE 110 ALPHAGO ZERO

Game playing. Chapter 5, Sections 1{5. AIMA Slides cstuart Russell and Peter Norvig, 1998 Chapter 5, Sections 1{5 1

CS 4700: Foundations of Artificial Intelligence

CS343 Introduction to Artificial Intelligence Spring 2010

Artificial Intelligence. Topic 5. Game playing

CMSC 372 Artificial Intelligence. Fall Administrivia

Transcription:

Progress has been tremendous Lawrence Snyder University of Washington, Seattle The inventors of ENIAC, 1 st computer, said it thinks with electricity Do calculators think? Does performing arithmetic, which is entirely algorithmic, require thinking? Once, performing arithmetic, was thought to be divinely or magically conferred ability Lawrence Snyder 2004 2 The inventors of ENIAC, 1 st computer, said it thinks with electricity Do calculators think? Does performing arithmetic, which is entirely algorithmic, require thinking? Once, performing arithmetic, was thought to be divinely or magically conferred ability The Problem: Many human activities look like thinking until they are understood (to be algorithmic) A.M. Turing, computer pioneer, worried about intelligence in humans & machines; proposed a test (1950) Aware that it is intelligence until it s understood, Turing devised a test with this experimental setup: A computer (A) and a person (B) are connected to an examiner, who can ask questions using text to determine which is which 3 4 Formulate questions a person can answer but a computer can t Interrogator In the first line of your sonnet which reads 'Shall I compare thee to a summer's day', would not 'a spring day' do as well or better? Computer It wouldn't scan. Interrogator How about 'a winter's day'? That would scan all right. Computer Yes, but nobody wants to be compared to a winter's day. Interrogator Would you say Mr. Pickwick reminded you of Christmas? Computer In a way. Interrogator Yet Christmas is a winter's day, and I do not think Mr Pickwick would mind the comparison Computer I don't think you're serious. By a winter's day one means a typical winter's day, rather than a special one like Christmas. 5 2011 Larry Snyder, CSE 6 1

Completely Automated Public Turing Test To Tell Computers and Humans Apart Developed at CMU by Luis Van Ahn and his team Joel Weizenbaum s Doctor [a\k\a Eliza ] was a program that appeared intelligent User: I m depressed. Doctor: Why are you depressed? User: My mother is not speaking to me. Doctor: Tell me about your mother. User: She doesn t want me to major in CS. Doctor: No? User: No, she wants me to go into medicine. Doctor was basically scripted 2011 Larry Snyder, CSE 7 8 The study of making computers act intelligently They already act intelligent e.g. they can correct your spelling mistakes Is this intelligent behavior? Most AI researchers would say no algorithmic Playing grandmaster level chess in a tournament became an AI goal (1952) - Minimizes real world knowledge - Clear goal, formal system Chess is a game, so it uses a game tree At each node is a board - - easily digitized Below it are all boards created in 1 move; below those, all boards needing another move An objective function evaluates goodness of the position: go for highest opponent goes for lowest 10 9 An IBM system, Deep Blue, played world champion Gary Kasparov In 1996 Kasparov won, but Deep Blue played 1 game well!!! This was a first. In May 11, 1997 Deep Blue won 3.5-2.5 Deep Blue is a 32 processor parallel computer with 256 chess processors that can consider 200,000,000 chess positions per second + opens + ends Does Deep Blue s performance show that a computer can be intelligent? No - - it repeat s its designers intelligence (weak rebuttal) Yes - - it s better than anyone in the world at something people find interesting and fun Maybe - - it shows intelligence in chess, but can it apply its intelligence elsewhere? What do you think? 11 12 2

True or false, a computer program to play poker would be similar to a computer program to play chess. You would create a tree, but the nodes would be hands instead of chess board positions. The program would evaluate the nodes in the tree to decide what to do. 13 14 15 2011 Larry Snyder, CSE 16 http://www.nytimes.com/interactive/ Compared to Deep Blue, Watson is much 2010/06/16/magazine/watson-trivia-game.html? ref=magazine Let s try it. more sophisticated in design, organization runs on ~2,500 parallel CPUs, each capable of up to 33 billion operations a second; size of small RV crawled and organized 200 million pages of data expert analyzers more than 100 different techniques running concurrently to analyze natural language, appraise sources, propose hypotheses, merge results and rank top guesses. 2011 Larry Snyder, CSE 17 3

Chess seems harder, but it s not Chess has fixed rules, little real world data needed Jeopardy, more free form using only real data Other differences In chess the problem is known beforehand, but in Jeopardy, someone else sets up the problem In chess, decisions are based on a formula, but in Jeopardy many forms of evaluation are needed (a problem solved by probabilities) In chess there is very little pre- planning, but in Jeopardy, organizing the data is the key Computers do things deemed creative in past Create designs in the style of Piet Mondrian, Jackson Pollack or Josef Albers Is it Art? Is it Creative? 2011 Larry Snyder, CSE 19 20 Creativity has two forms: flash out of the blue and incremental revision Flash, i.e. inspiration, is rare; is it just luck? Revision, i.e. hard work, is common and to a large degree algorithmic Advertising agencies are famous for creativity, but in a recent study, 89% of all award-winning ads were an application of one of six templates -- design algorithm An experiment at the U. of Oregon compose music in the style of Bach Three participants: Bach, U of O Professor, EPI program And the winner is Audience Thought: Bach s Professor s EPI s work was work was work was Professor EPI program Bach 21 2011 Larry Snyder, CSE 22 Robotics Facial recognition Route planning Displaying emotions Natural Language Processing Pattern recognition/prediction medicine, weather, economics, spam Recommender systems Image browsers 11/25/13 2011 Larry Snyder, CSE 23 24 4

Watson looks to be a major advance in AI and a big step towards answering Turing s Test TA Evaluations Course/Instructor Evaluations What is AI? 2011 Larry Snyder, CSE 25 11/26/13 2011 Larry Snyder, CSE 26 5