Ia 1112 T 2

Introduction II
Stuart Russel and Peter Norvig, Artificial Intelligence: A modern approach, 3rd edition, Pearson Education, 2010 http://aima.cs.berkeley.edu/ Ernesto Costa e Anabela Simes, Inteligncia Artificial: Fundamentos e Aplicaes (2 edio) FCA, Set. 2008
Some fundamental questions

Can a machine be truly intelligent? How can you tell whether a machine is intelligent? What kind of techniques and methods are useful in AI problem solving? What kind of hypothesis can we rise to build intelligence systems?
23-Nov-11 http://w3.ualg.pt/~jvo/ia 2-3
Criteria for success: Turing test

Human interrogator is free to ask any question If the human interrogator can not determine which is the Human without guessing then the AI system is successful
HUMAN HUMAN INTERROGATOR
?
AI SYSTEM
23-Nov-11
http://w3.ualg.pt/~jvo/ia
2-4
Criteria for success: turing test
Human Level Behavior Systems that behave like humans. Systems that think like humans.
Rationality
Systems that act rationaly. Systems that think rationaly.
HUMAN HUMAN INTERROGATOR
?
AI SYSTEM
Thinking
23-Nov-11
2-5
Alan Turing (1912-1954)

1912 (23 June): Birth, Paddington, London 1926-31: Sherborne School 1931-34: Undergraduate at King's College, Cambridge University 1932-35: Quantum mechanics, probability, logic 1935: Elected fellow of King's College, Cambridge 1936: The Turing machine, computability, universal machine 1936-38: Princeton University. Ph.D. Logic, algebra, number theory 1938-39: Return to Cambridge. Introduced to German Enigma cipher machine 1939-40: The Bombe, machine for Enigma decryption 1939-42: Breaking of U-boat Enigma, saving battle of the Atlantic 1943-45: Chief Anglo-American crypto consultant. Electronic work. 1945: National Physical Laboratory, London 1946: Computer and software design leading the world. 1947-48: Programming, neural nets, and artificial intelligence 1948: Manchester University 1949: First serious mathematical use of a computer 1950: "Computing machinery and intelligence" - The Turing Test 1951: Elected FRS. Non-linear theory of biological growth 1952: Arrested as a homosexual, loss of security clearance 1953-54: Unfinished work in biology and physics 1954 (7 June): Death (suicide) by cyanide poisoning, Wilmslow, Cheshire.
Church-Turing hypothesis
Anything that is computable is computable by a Turing Machine Conversely, the set of functions computed by a Turing Machine is the set of all and only computable functions
23-Nov-11
2-7
Turing Machine
23-Nov-11
2-8
Limits to computability: Halting problem

Given a description of a program and a finite input, decide whether the program finishes running or will run forever. It is impossible to construct a Universal Turing Machine that given any given pair <M, I> of a Turing Machine M and an input I, will decide if M halts on I
23-Nov-11
2-9
Limits to computability: Gdel Theorems

Informally,
In any consistent axiomatic system, there exist theorems that are impossible to prove or disprove There is no constructive procedure that will prove or disprove that a set of axioms is consistent
23-Nov-11
2-10
Gdels Incompleteness Theorem

Unprovable Provable
Untrue True
23-Nov-11
2-11
Kurt Gdel (1906-1978)

Major work: On Formally Undecidable Propositions in Principia Mathematica and Related Systems, 1931.
(Considered one of the most important results human thinking ever achieved)
23-Nov-11
2-12
Limits to computability: resources

NP-complete and NP-hard problems: Time for computation becomes extremely large as the length of input increases PSPACE complete: Space requirement becomes extremely large with the length of input
23-Nov-11
2-13
Example: Travelling Salesman Problem
23-Nov-11
2-14
Optimality & sufficiency

In many real world problems, there may be no possibility of us ever finding an optimal solution, or even proving that a provisional solution is optimal. It may be more appropriate to seek and accept a sufficient solution to a given problem, rather than an optimal one
23-Nov-11
2-15
Foundations of AI
Philosophy: Logic, reasoning, mind as a physical system, foundations of learning, language and rationality. Mathematics: Formal representation and proof computation, (un)decidability, (in)tractability, probability. algorithms,
Psychology: adaptation, phenomena of perception and motor control. Economics: formal theory of rational decisions, game theory. Linguistics: knowledge representation, grammar. Neuroscience: physical substrate for mental activities. Control theory: homeostatic systems, stability, optimal agent design.
23-Nov-11
2-16
Approaches or metaphors
Computational Conexionists Biological
23-Nov-11
2-17
Assumptions of the AI computational approach

Any intelligent action can be reproduced by symbol manipulation Physical Symbol System Hypothesis (Allen Newell, Herber Simon, 1976)
Restrictions to rationality implies a timely choice An expert knows about (7 2) * 10^4 facts on his/her domain of knowledge. Search compensates the lack of knowledge. Knowledge aleviates the need for Search.
Classical exemple: 8-puzzle

(N inicial) 123 47 685
123 4 7 685
123 475 68
12 473 685
123 475 6 8
123 4 5 678 (Objectivo)
23-Nov-11
2-19
Abordagens ou metforas
Computacional Conexionista Biolgica
23-Nov-11
2-20
10
Neurnios biolgicos e artificiais

x x 1
2 x x i n
w w 1 w 2 w i
n
23-Nov-11
2-21
Abordagem conexionista
O crebro como modelo As redes neuronais artificiais so dos sistemas (estatsticos) de aprendizagem mais populares e efectivos Gozam de caractersticas como: Processamento massivamente paralelo e distribudo Tolerante a rudo e a informao completa Degradao suave a falhas So aproximadores universais So capazes de generalizar
23-Nov-11
2-22
11

Ia 1112 T 2

Caricato da

Informazioni sul documento

Descrizione originale:

Titolo originale

Copyright

Formati disponibili

Condividi questo documento

Condividi o incorpora il documento

Opzioni di condivisione

Hai trovato utile questo documento?

Questo contenuto è inappropriato?

Copyright:

Formati disponibili

Ia 1112 T 2

Caricato da

Copyright:

Formati disponibili

Introduction II

Some fundamental questions

Criteria for success: Turing test

HUMAN HUMAN INTERROGATOR

Criteria for success: turing test

Systems that act rationaly. Systems that think rationaly.

HUMAN HUMAN INTERROGATOR

Alan Turing (1912-1954)

Limits to computability: Halting problem

Limits to computability: Gdel Theorems

Gdels Incompleteness Theorem

Kurt Gdel (1906-1978)

Limits to computability: resources

Example: Travelling Salesman Problem

Optimality & sufficiency

Assumptions of the AI computational approach

Classical exemple: 8-puzzle

123 4 5 678 (Objectivo)

Neurnios biolgicos e artificiais

Potrebbero piacerti anche