Artificial Intelligence (is no match for natural stupidity :)

Slides:



Advertisements
Similar presentations
The Development of AI St Kentigerns Academy Unit 3 – Artificial Intelligence.
Advertisements

Chapter 22 Limits to Computation. Copyright © 2013 Pearson Education, Inc. Publishing as Pearson Addison-Wesley Learning Objectives Explain what the Turing.
Introduction to Video Game Programming (VGP) Mr. Shultz.
Learning Objectives Explain what the Turing test was designed to show
Copyright © 2011 Pearson Education, Inc. Publishing as Pearson Addison-Wesley Limits to Computation Computers Can Do Almost {Everything, Nothing} lawrence.
Shailesh Appukuttan : M.Tech 1st Year CS344 Seminar
Soccer n58http://youtube.com/watch?v=ICgL1OWs n58 -Ygohttp://youtube.com/watch?v=N8Q15Uc.
Chapter 23 Computers Can Do Almost {Everything Nothing}: Limits to Computation.
Copyright © 2008 Pearson Education, Inc. Publishing as Pearson Addison-Wesley Fluency with Information Technology Third Edition by Lawrence Snyder Chapter.
Random Administrivia In CMC 306 on Monday for LISP lab.
Human Computation CSC4170 Web Intelligence and Social Computing Tutorial 7 Tutor: Tom Chao Zhou
1 4 questions (Revisited) What are our underlying assumptions about intelligence? What kinds of techniques will be useful for solving AI problems? At what.
Artificial Intelligence CS105. Group Presentation Project Week of November 7 to November 11 Group presentation Groups of 3/4 – Each group will get 12/16.
PSU CS 370 – Introduction to Artificial Intelligence Game MinMax Alpha-Beta.
Ch1 AI: History and Applications Dr. Bernard Chen Ph.D. University of Central Arkansas Spring 2011.
Chapter 22 Limits to Computation. Learning Objectives Explain what the Turing test was designed to show Discuss the issue of a computer being intelligent.
Artificial Intelligence Introduction (2). What is Artificial Intelligence ?  making computers that think?  the automation of activities we associate.
Artificial Intelligence (AI) Can Machines Think?.
Turing Test and other amusements. Read this! The Actual Article by Turing.
Game Playing. Towards Intelligence? Many researchers attacked “intelligent behavior” by looking to strategy games involving deep thought. Many researchers.
How Solvable Is Intelligence? A brief introduction to AI Dr. Richard Fox Department of Computer Science Northern Kentucky University.
Introduction to Machine Learning Kamal Aboul-Hosn Cornell University Chess, Chinese Rooms, and Learning.
Grades: 6-8 Subject: Artificial Intelligence An Introduction to the Turing Test.
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?
Lecture # 39 What Can’t Be Computed?. Computability Tractable problems (P): Can be solved by a a computer is some deterministic (reasonable) polynomial.
Overview of Artificial Intelligence (1) Artificial intelligence (AI) Computers with the ability to mimic or duplicate the functions of the human brain.
Section 2 Effective Groupwork Online. Contents Effective group work activity what is expected of you in this segment of the course: Read the articles.
Fluency with Information Technology
Game Playing Why do AI researchers study game playing?
The Need for Algorithms
Could you be friends with a robot?
Hello and welcome to today’s training.
Instructor: Vincent Conitzer
A Lesson on Rhetorical Appeals: Ethos, Pathos, Logos
Fundamentals of Information Systems, Sixth Edition
I Know it’s an Idiot But it’s MY artificial idiot!
CSC 515 – Applied AI 1. Origins of AI conference.
Rhetorical Appeals English III.
How can we become good leamers
Videos NYT Video: DeepMind's alphaGo: Match 4 Summary: see 11 min.
David Kauchak CS52 – Spring 2016
Lots of news about Artificial Intelligence in the press
Adversarial Search Chapter 5.
ARTIFICIAL INTELLIGENCE.
Revision until you drop...
Teaching Listening Based on Active Learning.
Artificial Intelligence
ELT General Supervision
Course Instructor: knza ch
Self-control You can eat your skittle now or you can wait.
Academic scenarios.
Artificial Intelligence (is no match for natural stupidity :)
(in general… and for this essay)
The Turing Test Minds & Machines.
“The Future of AI” Rogelio Ferreira Escutia December 1st, 2017
Instructor: Vincent Conitzer
Chartboost Help Site Competitive Analysis and Proposal
Quarter 1.
Redeem some dignity My fumble from previous lecture …
7 Essential Employability Skills
They Say, I Say Chapter 1 and 12
Instructor: Vincent Conitzer
Let's get going - 6 Top Tips for Self Motivation
Fluency with Information Technology Third Edition
Artificial Intelligence
1st GRADE SIGHT WORDS.
Lecture 1: General Communication Skills
Introduction to Artificial Intelligence
INFORMATION RETRIEVAL
CS51A David Kauchak Spring 2019
Presentation transcript:

Artificial Intelligence (is no match for natural stupidity :) Progress has been tremendous Artificial Intelligence (is no match for natural stupidity :) Lawrence Snyder University of Washington, Seattle © Lawrence Snyder 2004

Review Last time, we emphasized a key fact of algorithm design … You must be able to explain why an algorithm works It’s different for every algorithm You need to know, but often you may also have to explain it to someone else Our illustration was explaining why two sorting algorithms worked 1/1/2019 © 2011 Larry Snyder, CSE

Thinking with Electricity The inventors of ENIAC, 1st 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

Thinking with Electricity The inventors of ENIAC, 1st 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)

Turing’s Test 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

What Would You Ask? Formulate questions a person can answer but a computer can’t

Turing’s Idea of Interrogation 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. 1/1/2019 © 2011 Larry Snyder, CSE

Captcha Completely Automated Public Turing Test To Tell Computers and Humans Apart Developed at CMU by Luis Van Ahn and his team 1/1/2019 © 2011 Larry Snyder, CSE

Seeming To Be Intelligent 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

Artificial Intelligence 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

Playing Chess 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

Deep Blue vs Kasparov 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

Intelligent? 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?

And Now Watson plays Jeopardy 1/1/2019 © 2011 Larry Snyder, CSE

Watson: More Sophisticated Compared to Deep Blue, Watson is much 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. 1/1/2019 © 2011 Larry Snyder, CSE

The Test Comes This Week It may be anticlimactic for the public, but the CS community is all a-buzz because this is REALLY difficult technically It’s tough to “get” a pun! 1/1/2019 © 2011 Larry Snyder, CSE

Compare Watson, Deep Blue 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 1/1/2019 © 2011 Larry Snyder, CSE

Being Creative 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?

Definition of Creativity 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

Composing Music 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 1/1/2019 © 2011 Larry Snyder, CSE

Summary Watson looks to be a major advance in AI and a big step towards answering Turing’s Test What is AI? 1/1/2019 © 2011 Larry Snyder, CSE