Self
Test - AI Theory & History
CIS447
For all questions use the Word Bank (below) and write the letter of the correct answer.
1-2. Among A.I. researchers
there are two different procedural foci.
Name them.
3-4. Among A.I. researchers
there are two different foci for measuring success. Name them.
5-8. Each of the two procedural
foci can be paired with each of the measurements of success. List the outcome.
9-12. Match each of these to the
four major approaches to the study of A.I.
For
discussion: Which of these do you think underlay the representation of HAL in 2001 Space Odyssey?
What
about the movie A.I.
(13-32) Match the following
persons with their contribution to the field of A.I.
13. Aristotle
14. John von Neumann
15. McCulloch & Pitts
16. Claude Shannon
17. Newell & Simon
18. Robinson
19. Edward Feigenbaum
20. Joseph Weizenbaum
21. George Boole
22. Bertrand Russell &
Alfred North Whitehead
23. Gottlob Frege & Alfred
Tarski
24. Hilbert & Brouwer
25. David Hilbert
26. Kurt Goedel
27. John McCarthy
28. Alonzo Church
29. Emil Post
30. Alan Turing
31. Hartmanis, Stearn, Cobham
& Edmonds
32. Cook & Karp
(33-58) Identify the
following people who made major contributions of ideas leading to current work
in Artificial Intelligence.
33. Greek philosopher who did
foundational work in logic and science.
34. Co-founded decision theory;
proposed the stored program concept of computer architecture.
35-36. Proposed the idea of
modeling the human brain via networks of “neurons”.
37. Foundational work in information
theory; developed chess playing program.
38-39. Developed the Logic
Theorist, a theorem-proving program, and the General Problem Solver (GPS).
40. Developed resolution method
of theorem proving.
41. An unabashed promoter of the
expert systems approach; helped develop DENDRAL and MYCIN.
42. His ELIZA program was
designed to show how easy it is to create the illusion of intelligence in
computer programs.
43. Wrote The Laws of Thought.
44-45. Wrote the Principia Mathematica
46-47. Two pioneers in the development
of symbolic logic.
48-49. Their dispute over the
foundations of mathematics sparked many significant developments in the theory
of computation.
50. Initiated the search for
effective proof procedures
51. The Incompleteness Theorem
52. Turned the Lambda Caluculus
into the language Lisp.
53-56. Pioneered the study of the
complexity of computer algorithms.
57-58. Developed the theory of NP-completeness
(59-61) Identify these men
who formulated models of computation.
59. His model is a “machine”
that bears his name; he also developed a chess playing program and worked on
code breaking during World War II.
60. Developed the Lambda
Calculus, which is the basis for Lisp.
61. Developed “production
systems” which bear his name and which are the basis for the forward chaining
paradigm in expert systems.
(62-67) Identify the
following periods in the development of AI.
For each period name one person, program or significant development.
62. 1943-55: “Seeds” of ideas
developed.
62b. 1956: First major milestone
63. 1952-69: Rapid development
of early ideas amid unbridled optimism.
64. 1966-73: Problems
encountered; simple approaches do not “scale up”
65. 1969-79: Wide spread use of
expert systems.
66. 1980-present: Specialized A.I.
hardware & software companies sprout.
67. 1986 - present :: Revival of
McCulloch & Pitts’ model of computation.
67b. 1987 - present :: Rigorous theorems, hard experimental evidence, real-world applications
67c. 1995 - present :: Various A.I. work is tied together under a unifying concept.
(68-69) Identify these
significant results in the theory of computation.
68. A formal logical system
cannot be both complete and consistent.
69. Computable means Turing
Machine-computable.
(70-74) Complete the following
definitions.
70-71. A problem is _____ if there
are known algorithms which will produce the answer in a reasonable amount of
time. Otherwise it is _____.
72. A problem is in the class
_____ if there are known deterministic algorithms for it which run in
polynomial time.
73. A problem is in the class
_____ if there are known nondeterministic algorithms (but no known
deterministic ones) for it which run in polynomial time.
74. A problem is in the class
_____ if a deterministic polynomial time algorithm for it could be used to
yield deterministic polynomial time algorithms for all other NP problems.
(75-77) Identify these
difficulties with early work in AI.
75. Early programs contained
little or no _____ of their subject matter.
76. Many problems attacked were
inherently _____.
77. There were fundamental
limitations in the _____ used to generate intelligent behavior.
(78-79) Identify these
events in the history of AI.
78. A report in Britain critical
of AI which formed the basis for a decision by the British government to end
support for AI research in all but two universities.
79. A period of time when AI
fell out of favor, especially with respect to funding agencies.
Word
Bank :: AI Theory & History Self Test
CIS447
Answers to questions #1-32.
A. acting K. maximally
B. acting
humanly L. minimally
C. acting
rationally M. rational agent approach
D. aging N. rationally
E. aging
rapidly O. thinking
F. cognitive
modeling approach P. thinking humanly
G. growing Q. thinking maximally
H. growing
rationally R. thinking minimally
I. humanly S. thinking rationally
J. laws of
thought approach T. Turing Test approach
U. Co-founded
decision theory; proposed the stored program concept of computer architecture.
V. Developed
the Logic Theorist, a theorem-proving program, and the W. General Problem Solver (GPS).
X. Developed
resolution method of theorem proving.
Y. Developed
the theory of NP-completeness
Z. Did
foundational work in information theory; developed chess playing program.
AA. Greek
philosopher who did foundational work in logic and science.
BB. His
ELIZA program was designed to show how easy it is to create the illusion of
intelligence in computer programs.
CC. The
Incompleteness Theorem
DD. Initiated
the search for effective proof procedures
EE. Invented
a finite state machine with a read/write head and a tape for storage as a
theoretical model of computation
FF. Invented
the Lambda Calculus as a theoretical model of computation
GG. Invented
the production system as a theoretical model of computation
HH. Pioneered
the study of complexity of computer algorithms.
II. Pioneers
in the development of symbolic logic.
JJ. Proposed
the idea of modelling the human brain via networks of “neurons”.
KK. Their
dispute over the foundations of mathematics sparked many significant
developments in the theory of computation.
LL. Turned
the Lambda Calculus into the language Lisp.
MM. An
unabashed promoter of the expert systems approach; helped develop DENDRAL and
MYCIN.
NN. Wrote The Laws of Thought.
OO. Wrote
the Principia Mathematica
Answers to questions #33-58.
A. Aristotle
B. George
Boole
C. David
Brouwer
D. Cobham
E. Cook
F. Edmonds
G. Edward
Feigenbaum
H. Gottlob
Frege
I. Kurt
Goedel
J. Hartmanis
K. George
Haliburton
L. David
Hilbert
M. Karp
N. Charlie
McCarthy
O. John
McCarthy
P. Cyrus
McCormick
Q. McCulloch
R. Alan
Newell
S. Pitts
T. Albert
Renewal
U. Robinson
V. Bertrand
Russell
W. Claude
Shannon
X. Herbert
Simon
Y. Stearn
Z. Alfred
Tarski
AA. Allen
Trout
BB. Joseph
Weizenbaum
CC. Alfred
North Whitehead
DD. John von
Neumann
Answers to questions #59-79.
A. AI Favor NN. problem scales
B. AI Fever OO. rapid enthusiasm
C.
C PP. retraction
D.
D QQ. scalar problems
E. AI
Funding RR. software
F. The AI
Industry SS. strategies
G. AI
Winter TT. tractable
H. Alonzo
Church UU. Alan Turing
I. application WW. The Warren Commission Report
J. Church-Turing
Thesis XX. wide knowledge
K. Computability Theorem YY. Birth of A.I.
L. Computability
Thesis
M. A dose
of reality
N. early
enthusiasm; great expectations
O. Emil
Post
P.
P
Q. gestation
R. hardware
S. incompatible
T. The
Incompleteness Theorem
U. inhospitable
V. intractable
W. in
traction
X. The
Lighthill Report
Y. Logic
Systems Theorem
Z. The
Luskatov Report
AA. The
Kennedy Report
BB. knowledge
CC. knowledge-based
systems
DD. McCulloch
connection
EE.
NA
FF.
ND
GG.
ND-complete
HH. Neural
Networks again
II.
NP
JJ.
NP-complete
K.
NP-incomplete
LL. Pittsburgh
connection
MM. planting