AI and Automation Media and Culture Lecture 9 John Lee.

Slides:



Advertisements
Similar presentations
Artificial Intelligence
Advertisements

ARTIFICIAL INTELLIGENCE [INTELLIGENT AGENTS PARADIGM] Professor Janis Grundspenkis Riga Technical University Faculty of Computer Science and Information.
Computational Models The exam. Models of computation. –The Turing machine. –The Von Neumann machine. –The calculus. –The predicate calculus. Turing.
CS 345: Chapter 9 Algorithmic Universality and Its Robustness
ICE1341 Programming Languages Spring 2005 Lecture #6 Lecture #6 In-Young Ko iko.AT. icu.ac.kr iko.AT. icu.ac.kr Information and Communications University.
Introducing Formal Methods, Module 1, Version 1.1, Oct., Formal Specification and Analytical Verification L 5.
Propositional Logic Reading: C , C Logic: Outline Propositional Logic Inference in Propositional Logic First-order logic.
An Introduction to Artificial Intelligence. Introduction Getting machines to “think”. Imitation game and the Turing test. Chinese room test. Key processes.
ISBN Chapter 3 Describing Syntax and Semantics.
CS 355 – Programming Languages
Comp 205: Comparative Programming Languages Semantics of Imperative Programming Languages denotational semantics operational semantics logical semantics.
Humans, Computers, and Computational Complexity J. Winters Brock Nathan Kaplan Jason Thompson.
Introduction to AI & AI Principles (Semester 1) WEEK 7 John Barnden Professor of Artificial Intelligence School of Computer Science University of Birmingham,
Copyright © 2006 The McGraw-Hill Companies, Inc. Programming Languages 2nd edition Tucker and Noonan Chapter 18 Program Correctness To treat programming.
COMP 3009 Introduction to AI Dr Eleni Mangina
Dr. Muhammed Al-Mulhem 1ICS ICS 535 Design and Implementation of Programming Languages Part 1 Fundamentals (Chapter 4) Axiomatic Semantics ICS 535.
Describing Syntax and Semantics
What computers just cannot do. COS 116: 2/28/2008 Sanjeev Arora.
Slides 00 1 Advanced Logics Part 1: Lambda Calculus and Type Theory Lecturer: Lim Yohanes Stefanus Part 2: Modal Logic Lecturer: Gregory Wheeler.
Lecture 1 Introduction: Linguistic Theory and Theories
Intelligence & Artificial Intelligence You must have a pre-prepared sentence or two to spout about what is a description of intelligence.. And what is.
C OURSE : D ISCRETE STRUCTURE CODE : ICS 252 Lecturer: Shamiel Hashim 1 lecturer:Shamiel Hashim second semester Prepared by: amani Omer.
More Theory of Computing
CSCI 4325 / 6339 Theory of Computation Zhixiang Chen Department of Computer Science University of Texas-Pan American.
1 Neural Networks and Statistics: Intelligence and the Self Prof Bruce Curry and Dr Peter Morgan Cardiff Business School, UK.
Chapter 6: Objections to the Physical Symbol System Hypothesis.
Chapter 14: Artificial Intelligence Invitation to Computer Science, C++ Version, Third Edition.
Notes for Chapter 12 Logic Programming The AI War Basic Concepts of Logic Programming Prolog Review questions.
Host and Application Security Lesson 3: What is Information?
1 CO Games Development 2 Week 21 Turing Machines & Computability Gareth Bellaby.
ENM 503 Lesson 1 – Methods and Models The why’s, how’s, and what’s of mathematical modeling A model is a representation in mathematical terms of some real.
For Friday Read chapter 27 Program 5 due.
For Friday Read chapter 27 Program 5 due. Program 5 Any questions?
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.
Course Overview and Road Map Computability and Logic.
Section 2.3 I, Robot Mind as Software McGraw-Hill © 2013 McGraw-Hill Companies. All Rights Reserved.
1 CS 385 Fall 2006 Chapter 1 AI: Early History and Applications.
1 The main topics in AI Artificial intelligence can be considered under a number of headings: –Search (includes Game Playing). –Representing Knowledge.
Turing Machines and the Halting Problem This work is licensed under the Creative Commons Attribution-NonCommercial-ShareAlike 3.0 Unported License. To.
3.2 Semantics. 2 Semantics Attribute Grammars The Meanings of Programs: Semantics Sebesta Chapter 3.
Programming Languages and Design Lecture 3 Semantic Specifications of Programming Languages Instructor: Li Ma Department of Computer Science Texas Southern.
Artificial Intelligence and Knowledge Based Systems Fall 2009 Frank Hadlock.
SIMULATIONS, REALIZATIONS, AND THEORIES OF LIFE H. H. PATTEE (1989) By Hyojung Seo Dept. of Psychology.
1Computer Sciences Department. Book: INTRODUCTION TO THE THEORY OF COMPUTATION, SECOND EDITION, by: MICHAEL SIPSER Reference 3Computer Sciences Department.
Artificial Intelligence 7. Making Deductive Inferences Course V231 Department of Computing Imperial College, London Jeremy Gow.
Artificial Intelligence “Introduction to Formal Logic” Jennifer J. Burg Department of Mathematics and Computer Science.
Introduction to Artificial Intelligence CS 438 Spring 2008.
Complexity & Computability. Limitations of computer science  Major reasons useful calculations cannot be done:  execution time of program is too long.
11 Artificial Intelligence CS 165A Thursday, October 25, 2007  Knowledge and reasoning (Ch 7) Propositional logic 1.
CSE Winter 2008 Introduction to Program Verification January 8 Boolean operators.
Capabilities of computing systems Numeric and symbolic Computations A look at Computability theory Turing Machines.
Fundamentals of Informatics Lecture 12 The Halting Problem Bas Luttik.
INTRODUCTION TO COGNITIVE SCIENCE NURSING INFORMATICS CHAPTER 3 1.
Umans Complexity Theory Lectures Lecture 1b: Turing Machines & Halting Problem.
Artificial Intelligence Knowledge Representation.
The Church-Turing Thesis Chapter Are We Done? FSM  PDA  Turing machine Is this the end of the line? There are still problems we cannot solve:
Modeling Arithmetic, Computation, and Languages Mathematical Structures for Computer Science Chapter 8 Copyright © 2006 W.H. Freeman & Co.MSCS SlidesTuring.
Proof And Strategies Chapter 2. Lecturer: Amani Mahajoub Omer Department of Computer Science and Software Engineering Discrete Structures Definition Discrete.
CSE202: Introduction to Formal Languages and Automata Theory
New Directions in Information Technology Lecture 5 John Lee
CSE 311 Foundations of Computing I
Programming Languages 2nd edition Tucker and Noonan
Theory of Computation Turing Machines.
KNOWLEDGE REPRESENTATION
CO Games Development 2 Week 21 Turing Machines & Computability
Information Retrieval
Programming Languages 2nd edition Tucker and Noonan
Theory of Computation Lecture 23: Turing Machines III
Presentation transcript:

AI and Automation Media and Culture Lecture 9 John Lee

Introduction: what is “AI”? Two major areas where “AI” is talked about: –engineering/automation –studying, perhaps emulating, human cognition In practice, these do not often overlap –(maybe they do in this video!)this video –but at a theoretical level they share many issues and approaches … Crucial general issue: how do we bring formal techniques to bear in an informal world? –“ In logic, mathematics, and computer science, a formal system is a formal grammar used for modelling purposes. Formalization is the act of creating a formal system, in an attempt to capture the essential features of a real-world or conceptual system in formal language.” (Wikipedia, )

An unusual case …

Examples of formal systems Arithmetic (formal theory and calculus of numbers) Logic (formal theory and calculus of propositions) Natural language grammars –Chomsky and all that … Shape grammars –( Music grammars –(Lehrdahl, F. and R. Jackendoff A Generative Theory of Tonal Music, Cambridge, Mass: MIT Press) Databases Knowledge bases Meteorological models (fluid dynamics) Economic models

Formality and formalisation Central issue in AI and automation (but also much else): –Computer is an entirely formal system, but world (and people) seem not to be –How to go from informal world to formal system, derive some result, and then get back again without losing anything important?

(What is important?) What should be preserved? –truth? –meaning? Use of any formal system inevitably involves a number of translation steps: Informal statement Formal statement Calculation (Inference) ResultReinterpretation

Basic logical principles Analysis of natural language (e.g. English) argument: –translation into logical form, application of rules, then translation back … Compare analysis of arithmetical calculation: –Suppose 82 students get 175 pages of notes each … –Form is: result = A x B = 82 x 175 … –Calculation gives: result = 14,350 –So we need (e.g.) to budget for 14,350 copies Informal statement Formal statement Calculation (Inference) ResultReinterpretation

… basic principles (continued) A simple argument (application of modus ponens): –If the switch is down, (then) the light is on; the switch is down … –If P then Q; P … P –> Q P Q –… therefore Q –So the light is on Informal statement Formal statement Calculation (Inference) ResultReinterpretation

COMPUTATION What is it? Why is it important?

Turing's machine The first properly worked out theory of computation … an abstract formal machine head and tape: –head can read, erase, write symbols, and move tape one square left or right –head is defined by a few rules e.g.: if the symbol below head is ‘1’, erase it, write a ‘0’, and move one square left –input for problem is posed by writing it on the tape at start time –output from the problem is on the tape at ‘halt’ time –given machine defines a mathematical function (set of pairs of input/output)

Simple example … an adding machine — two numbers in ‘tally notation’ separated by blank machine finds blank, ‘moves 1s across blank’ until finished infinite (or extendable) machines — can always add more tape IIIIIII IIIIIII Head

Universal machines a Universal machine can mimic any other Turing machine mimicked machine is encoded as number on U-machine's tape, along with input for particular problem for mimicked machine U-machine can mimic the encoded machine solving the problem Turing then proved that there are functions which U-machine can't compute … –notably the ‘halting problem’: will machine halt when computing a given function? … but developed the “Church-Turing” thesis that: –a Universal Turing Machine can compute anything that can be computed at all A staggering result from such a simple starting point! Corollary: some functions cannot be computed at all …

What is so important about Turing's machine? active head vs. passive memory: treating program as data hardware vs. software — distinguish abstract computation from physical implementation can consider large range of alternative implementations establishes an abstract ‘informational’ level for describing behaviour –in fact, engineered computers are like Turing machines with random access memory (RAM) (not infinite, unfortunately) –and vastly complicated heads called central processing units (CPUs) –(these are technically “von Neumann” machines)

Automation of logical proof Sometimes proofs can be computable Even whole systems of proof Programming languages can be based on this –E.g. Prolog –A language based on theorem proving from FACTS and RULES factorial(1, 1). factorial(Num, Factorial):- M is Num-1, factorial(M, FM), Factorial is FM*Num. Compare: int factorial(int x) { if (x == 1) return x; else return x*factorial(x-1); } (Declarative)(Procedural)

Applications of AI What can we do with these ideas, and how?

General applications of AI (1): Representation of knowledge (Contrast with data … –knowledge is richer and includes means of deriving consequences) Rule-based systems –Cf Prolog: represent everything with facts and rules … –… then derive consequences by proof. –Assumes all knowledge can be captured this way –As in traditional expert systems Case-based reasoning –Suppose that systems of rules will be too complicated … –Instead store cases that have worked in the past, –and some rules for working out how to re-use these

General applications of AI (2): Approaches to formal semantics Meaning as truth conditions What does the world have to be like for a sentence to be true? Provides semantics for simple systems like propositional or predicate calculus Can be elaborated for use with natural languages, e.g. –Consider the world at other points in time –Consider other possible worlds What can this approach not capture?

Understanding humans How can we use computational theories to understand the workings of the human mind? Is this an illusory goal?

Representational theories of mind The Computational Metaphor: hard and soft AI Contrast between focus on representation and focus on behaviour What is "intelligence"? –Is it what you can do or is it how you do it? The Turing Test –The Loebner Prize – –Eliza Dennett, the "Intentional Stance" and instrumentalism –Idea that notions like “intelligence” are attributed –Linked to anti-essentialism and anti-realism

Connectionist approaches and non-representationalism Connectionism, or “neural-net”-based theories –Distributed processing –No explicit locus of symbols or syntactic structures Emergence –The sum of a system can be more than its parts Environmental embedding and situated action –Lucy Suchman Compare philosophical approaches of, e.g. –Heidegger (existential embedding) –Wittgenstein (social embedding)

Two classic critiques Dreyfus – phenomenology & Heidegger – Winograd & Flores –Fundamentalist anti-representationalism –Strong AI is impossible in principle 近义词近义词 Searle – the “Chinese Room” – More pragmatic argument – Homunculus knows nothing, hence system cannot be a locus of understanding – Extended as claim that no mere symbol-processing system could ever “understand” anything at all – Claimed to be an “in-principle” argument

AI in practical use What is actually being done using these ideas?

Practical considerations: AI as software engineering Various general application fields –Expert systems Either rule-based or case-based –Verification systems To prove e.g. properties of safety-critical software –Language engineering – LSA – etc. Used e.g. to mark essays Information extraction, e.g. as in Edinburgh-Stanford LinkEdinburgh-Stanford Link Combined maybe with text/speech generation: –Dialogue systems Increasingly multimodal: speech, gesture, etc. Telephone sales etc. applications; commercial “chatbots”commercial “chatbots” Entertainment, e.g. the BBC’s Jamie KaneJamie Kane –ITSs Will teachers be replaced by computers? Importance of the social …

Design/architecture applications Representation of design knowledge (contrast with Schön!) –Cf. Coyne et al. Knowledge-Based Design Systems Intelligent information design and presentation Automated musical compositionmusical composition Shape grammars ( CBR Building performance evaluation systems Standardisation and automation in construction Issues of “prescriptiveness” …