Robotics AI Illusions of intelligence Alan Turing Lab: Combine sound and light exercises. Homework: Identify & describe problems with the automatic solution.

Slides:



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

Approaches, Tools, and Applications Islam A. El-Shaarawy Shoubra Faculty of Eng.
Information and Software Technology Option: Artificial intelligence, simulation and modelling.
Completeness and Expressiveness
Heuristic Search techniques
Presentation on Artificial Intelligence
Information and Software Technology
CS 345: Chapter 9 Algorithmic Universality and Its Robustness
The Recursion Theorem Sipser – pages Self replication Living things are machines Living things can self-reproduce Machines cannot self reproduce.
Class 39: Universality cs1120 Fall 2009 David Evans University of Virginia.
An Introduction to Artificial Intelligence. Introduction Getting machines to “think”. Imitation game and the Turing test. Chinese room test. Key processes.
Presentation By: Tripti Negi Priyanka Kapil gogia Gurpeet Singh.
WHAT IS ARTIFICIAL INTELLIGENCE?
1 Introduction to Computability Theory Lecture12: Decidable Languages Prof. Amos Israeli.
Approaches to AI. Robotics Versus Artificial Intelligence.
1 Lecture 33 Introduction to Artificial Intelligence (AI) Overview  Lecture Objectives.  Introduction to AI.  The Turing Test for Intelligence.  Main.
CHAPTER 3 The Church-Turing Thesis
Artificial Intelligence
3.11 Robotics, artificial intelligence and expert systems Strand 3 Karley Holland.
Artificial Intelligence
Chapter 13: Is Artificial Intelligence Real?
Intelligence & Artificial Intelligence You must have a pre-prepared sentence or two to spout about what is a description of intelligence.. And what is.
Artificial Intelligence Dr. Paul Wagner Department of Computer Science University of Wisconsin – Eau Claire.
CSCI 4410 Introduction to Artificial Intelligence.
Chapter 10. Global Village “… is the shrinking of the world society because of the ability to communicate.” Positive: The best from diverse cultures will.
Artificial Intelligence Introduction (2). What is Artificial Intelligence ?  making computers that think?  the automation of activities we associate.
111 Computability, etc. Recap. Present homework. Grammar and machine equivalences. Turing history Homework: Equivalence assignments. Presentation proposals,
Chapter 10 Artificial Intelligence. © 2005 Pearson Addison-Wesley. All rights reserved 10-2 Chapter 10: Artificial Intelligence 10.1 Intelligence and.
Artificial Intelligence: Prospects for the 21 st Century Henry Kautz Department of Computer Science University of Rochester.
Artificial Intelligence Introductory Lecture Jennifer J. Burg Department of Mathematics and Computer Science.
Artificial Intelligence
The Turing machine Olena Lastivka. Definition Turing machine is a theoretical device that manipulates symbols on a strip of tape according to a table.
Theory of Computing Lecture 15 MAS 714 Hartmut Klauck.
Algorithms and their Applications CS2004 ( ) Dr Stephen Swift 1.2 Introduction to Algorithms.
111 Discrete Mathematics Computability Brief introduction to computable functions, recursive functions, etc. Jeanine Meyer.
1 111 Computability, etc. Midterm review. Turing machines. Finite state machines. Push down automata. Homework: FSA, PDA, TM problems (can work in teams)
ARTIFICIAL INTELLIGENCE BY:Jeff Brauer, David Abarbanel, Monica Balod, Mae Anglo, Umangi Bhatt.
1 Artificial Intelligence Introduction. 2 What is AI? Various definitions: Building intelligent entities. Getting computers to do tasks which require.
Artificial Intelligence Bodies of animals are nothing more than complex machines - Rene Descartes.
Artificial Intelligence By Michelle Witcofsky And Evan Flanagan.
How Solvable Is Intelligence? A brief introduction to AI Dr. Richard Fox Department of Computer Science Northern Kentucky University.
1 CS 2710, ISSP 2610 Foundations of Artificial Intelligence introduction.
I Robot.
Artificial Intelligence: Introduction Department of Computer Science & Engineering Indian Institute of Technology Kharagpur.
Halting Problem Introduction to Computing Science and Programming I.
1 CS 385 Fall 2006 Chapter 1 AI: Early History and Applications.
Course Instructor: K ashif I hsan 1. Chapter # 1 Kashif Ihsan, Lecturer CS, MIHE2.
1 The main topics in AI Artificial intelligence can be considered under a number of headings: –Search (includes Game Playing). –Representing Knowledge.
1Computer Sciences Department. Book: INTRODUCTION TO THE THEORY OF COMPUTATION, SECOND EDITION, by: MICHAEL SIPSER Reference 3Computer Sciences Department.
Automata & Formal Languages, Feodor F. Dragan, Kent State University 1 CHAPTER 3 The Church-Turing Thesis Contents Turing Machines definitions, examples,
CSCI 4310 Lecture 2: Search. Search Techniques Search is Fundamental to Many AI Techniques.
ARTIFICIALINTELLIGENCE ARTIFICIAL INTELLIGENCE EXPERT SYSTEMS.
Spring, 2005 CSE391 – Lecture 1 1 Introduction to Artificial Intelligence Martha Palmer CSE391 Spring, 2005.
Capabilities of computing systems Numeric and symbolic Computations A look at Computability theory Turing Machines.
Topics: more AI Expert systems. Genetic algorithms. Neural Networks. Review for midterm.
CS 154 Formal Languages and Computability April 5 Class Meeting Department of Computer Science San Jose State University Spring 2016 Instructor: Ron Mak.
Decision Support and Business Intelligence Systems (9 th Ed., Prentice Hall) Chapter 12: Artificial Intelligence and Expert Systems.
Artificial Intelligence
Introduction to Artificial Intelligence Heshaam Faili University of Tehran.
Inexact Reasoning 2 Session 10
Introduction to Computing Science and Programming I
Chapter 11: Artificial Intelligence
PART IV: The Potential of Algorithmic Machines.
A I (Artificial Intelligence)
Course Instructor: knza ch
Introduction Artificial Intelligent.
Artificial Intelligence introduction(2)
Artificial Intelligence (Lecture 1)
TA : Mubarakah Otbi, Duaa al Ofi , Huda al Hakami
Algorithms CSCI 235, Spring 2019 Lecture 37 The Halting Problem
Presentation transcript:

Robotics AI Illusions of intelligence Alan Turing Lab: Combine sound and light exercises. Homework: Identify & describe problems with the automatic solution similar to ‘human’ and problems with the automatic solution very different

Artificial Intelligence Definitions? –Machine (computer) simulating human reasoning –Machine (computer) demonstrating surprisingly human intelligence Problem for field: as soon as some AI research proves practical, it isn’t considered AI! –American Association for Artificial Intelligence (AAAI) –AAAI/Nova interview with Cynthia Breazeal

Different strategies Work to solve problem, using any technique that works Work to understand how humans reason enough to implement these ways using computers (cognitive science) and use implementations to test ideas

Methods Symbolic manipulation (as opposed to numerical calculations) Enumerating / expanding trees of possibility: branch-and-bound search Expert systems: states and testing conditions. Neural nets (and other forms of machine learning)

Expert systems Collection of rules: If (A, B, C) then do D Using the expert system consists of going through the rules and doing the actions Early example: medical diagnosis. –Do checks –Actions may be do another test –Arrive at diagnosis

Neural nets Modeled after how brain may work Define graph (nodes, directed edges) –Nodes conditions –Edge from A to B if A leads to B Different techniques for building and refining net, including trying many cases and putting weight on edge if it leads to good result 01/robots-display-predator-prey-co-evolution- evolve-better-homing-techniqueshttp:// 01/robots-display-predator-prey-co-evolution- evolve-better-homing-techniques

Pattern recognition Need to extract measurable features These constitute the signature Compare to archive Example: facial recognition. Features such as ratio of spaces between eyes to eyes to chin. Need to use ratios for such things.

Topics/problems Theorem proving: technique to assume negative and see if you reach a contradiction by trying all combinations. Natural language processing for interface –My abominable abdomen project vs moon rocks query Natural language processing for translation: currently has some success/utility Speech recognition –Depends on size of language, restrictions and/or training

Histor Attempt to make use of outtakes from interviews used for documentary of Jacques Lipchitz, sculptor: 1970! Use keywords linking to segments to have Jacques answer questions –Illusion only of natural language –System continually massaged –Updated to work with latest technology If [art, Histor] moves you, you must be satisfied. Quote from Jacques Lipchitz about art in general. Can apply to using Histor. AI?

Eliza 1960s program (parady) by Joseph Weizenbaum to emulate a therapist (Rogerian) Relatively simple manipulation of patient’s remarks with randomly inserted stock questions. –“My head hurts.” “Why do you think your head hurts”. –“I feel bad today.” “What do you think about your mother.” Fairly successful!

Alan Turing Significant theoretical work on computation (Decision Problem) Worked at Bletchley Park during WWII on decoding German codes (Enigma machine): done by altering a coding machine Worked various places, including Princeton, with Van Neumann, others, on early computers Proposed way to build a chess machine Defined Turing test

Decision problem Theoretical problem, set by Hilbert (1900) Entscheidungsproblem: What does it mean for something to be computable? Turing (1936) produced 2 formulations (Turing machines & recursive functions) and proved them equivalent (and later proved these equivalent to a formulation of Post). Also proved limitations many others

Turing machine Infinite strip of tape Machine has finite number of states. A state holds the definition of what to do when reading a 0 or 1 on the tape Machine reading a spot on the tape can –Move (on tape) left or right or stop –Write something on tape (re-write) –Change state Turing machine computes a function on an input if it stops. The result is the number on the tape (technically, answer is number of 1s on the tape or one more)

Universal Turing machine Encode a Turing machine to be a single number A Universal Turing machine takes as input the number representing a TM plus input and produces the result that the TM would produce from that input

Recursive functions Functions from vectors/tuples to vectors/tuples Built up from basic functions –Constant functions F(x 1, x 2,..x k ) = n –Successor function F(x) = x+1 –Projection F i k (x 1, x 2,..x k ) = x i Using –Composition –Primitive recursion –Inverse (aka μ operator)

Turing test Set up a judge to have a ‘conversation’ using text messages back and forth to a machine and to a human. If the judge cannot tell the difference, then the machine has passed the [Turing] test. What about Histor? What about Eliza? Should the test be harder?

Robotics Robotics has been considered part of AI in computer science but also in engineering Are AI techniques such as pattern recognition, expert systems, neural networks, especially applicable to physical tasks?

Preview / Commercial Fall course Advanced Topics in Computer Science will include computability, AI and encryption (including recent news about vulnerability of current practices), etc. Beautiful Exercise in logical thinking

Lab Follow line and turn around when there is a sound. Your own idea. Ideas: –From outside the blue oval, start when someone claps, move to the circle and follow line. –From outside (especially track in the back), go in one direction and keep track of each blue line passed. Use variable (suitcase). Display count. –[Needs singing/hum] Start at rest. When sound is greater than a certain level, go around oval. If and when sound stops (falls), turn to inside of oval and stop leave oval –Add bump sensor (perhaps in back or combined with light?) Your own challenge to the class?

Homework Identify a problem/task for which the automated solution/approach is –Similar to the human way –Different from the human way Postings Preview: AI topics are options for research presentation as are 'real world' robotics, real robots versus robots in literature, health, miltiary,ethics, etc.