Questions and Answers of Introduction To Artificial Intelligence

What do you think intelligence is? The Archimedean sunflower.
Read Descartes and see if you can determine whether he thought machines could reproduce themselves.
(a) Find a finite description for the set of points that are the intersections of the 24 Archimedean spirals, having equations of the formwhere k = 0,1,2, . . . ,11.(b) Find a finite description
Two other introspective philosophers were Montaigne and Pascal. What do you think their attitudes would have been toward artificial intelligence? How about Jefferson, Marx, Archimedes, and Einstein?
Construct a next-move function for a "unary multiplier," which, given an input stringconsisting of a string of m 1's followed by a string of n 1's, produces on its tape an output string containing mn
(a) Show that any Turing machine can be represented by a natural number (an integer greater than zero).(b) Give a finite description for a function f mapping the natural numbers into [0,1], such
In 1962 there were on this planet about 55,000 scientific journals publishing about 1,200,000 articles per year; there were also 60,000 scientific books and 100,000 other research reports issued per
Consider a simple "polycephalic" Turing machine which has two tapes, i1 and i2, each of which is filled completely by zero's except for a single block of 1's. Let the blocks of 1's on the two tapes
(a) For the map shown below, find the shortest path that starts at city A, visits each of the other cities only once, and then returns to A.(b) Find the path from start to finish, which passes once
Find your way out of the Maze of Dedalus.first solve the problems that are given. Next, make a list of the subproblems you considered while solving them. Discuss how a computer might be programmed to
Assign a decimal digit to each of the letters in the words "send," "more," and "money," such that when the letters are replaced by the corresponding digits the following summation is true:No digit
Nine blocks are placed in a tray as shown below,(a) How many different configurations of the blocks may be obtained by sliding them about in the tray?(b) How many different configurations of the
(a) Analyze Giveaway Chess, played as follows:(1) Captures must be made, although a player may choose which capture to make, if more than one is available.(2) Pawns must be promoted to queens if
Suppose we are given that nodes B, C, and D in Fig. 3–8 represent trivially solvable problems.Fig. 3–8 (a) What can be said about the solvability of node A?(b) What if B, C, and D are
You have a road map for the area surrounding your present location; however, because the map was produced by the Super-Duper gas-station chain, it shows only the roads in a 30-mile circle, the north
Initially three disks of different sizes, each having a hole in its center, are placed as shown in the diagram below, all of them about one of three pegs. It is desired to transfer their initial
First solve the problems that are given. Next, make a list of the subproblems you considered while solving them. Discuss how a computer might be programmed to solve each of the given problems, and
Show that it is impossible to completely cover the "mutilated-checkerboard" with 1 x 2 tiles so that the tiles neither overlap nor stick out over the edge of the board.first solve the problems that
(a) Show how White can move to gain at least a draw.(b) What subproblems did you consider in finding a solution to (a)?(c) Discuss how a computer might be programmed to solve Chess end-game
Design a computer program that, given the line drawing of the Maze of Dedalus (Exercise 3–1), can find a path out.Exercise 3–1Find your way out of the Maze of Dedalus.
Three missionaries and three cannibals are all on one bank of a river they wish to cross. They have a boat, which will hold two persons, but which can be rowed by one if necessary. If the cannibals
A certain patent attorney was astonished when he received the simultaneous allowance of five patents, for five separate clients, each of whom lived in a different city.His astonishment turned to
A monkey is in a room where a bunch of bananas is hanging from the ceiling, too high to reach. In the corner of the room is a box, which is not under the bananas. The box is sturdy enough to support
First solve the problems that are given. Next, make a list of the subproblems you considered while solving them. Discuss how a computer might be programmed to solve each of the given problems, and
Why should a depth-first search procedure always expand the most recently generated node first?
Estimate whether the complete generation and minimax evaluation of the game trees for Chess and GO can be performed by(a) A "conventional" machine;(b) An "attainable" machine;(c) A "theoretical
Investigate whether it is epistemologically adequate to describe real-world phenomena as the plays of a partially specified game, for which it is necessary to infer some of the rules. Is such a
(a) Find the optimal strategy for the game of Poker Coins, the rules of which are:(1) A player throws N coins; he then puts one or more aside and rethrows the rest.(2) This throwing is repeated
What subproblems might a computer need to solve in order to put together jigsaw puzzles?
What subproblems are involved in solving the following analogy problem? Find X such that A:B: :C:X.(Evans, 1963, reprinted with permission.) 1 о A 2 В Д 3 0 4 О C 5
Write a paper discussing the interrelationships between the problems of pattern recognition, pattern matching, pattern classification, and pattern description.
Investigate ways of describing and generating potentially infinite structures such as these: a b * BBBBBBBBBBE DXDX
What are the visual subproblems to be solved by a computer program for tying and untying knots? A Syllogism worked out. That story of yours, about your once meeting the sea-serpent, always sets me
Describe how a computer might be programmed to recognize human faces.
Show that U → V can be rewritten as ⌉ (U, ⋀V).
Find clause-form equivalents for the following formulas:(a) ∀x(P(x)→⋁(P(x),Q(x))).(b) (⌉∀xP(x)→(∃x⌉P(x)).(c) (∀x∃y⋀ (P(x),Q(x,y)))→∃>x⋀ (P(x),Q(x,x)).
Find most general unifiers for each of the following sets of literals:(a) {Q(x,a,y),Q(a,x,y)}.(b) {P(x,f(x)),P(g(x),a))}.(c) {R(u,w,f(u)),R(b,x,g(x))}.(d) {W(z,c,f(y)),W(a,x,z),W(f(y),u,g(x)}.
Use the resolution principle to derive contradictions from the negations of each of the following predicate calculus tautologies:(a) ∀x(P(x)→P(x))(b) (⌉∃xP(x)→(∀x⌉P(x))(c) (∀x⋁
Construct a predicate calculus formalization for the Missionaries-and-Cannibals Problem (Exercise 3–2); give a resolution-based proof that it is solvable and use the example-construction technique
Present a predicate calculus formalization for the Mutilated Checkerboard Problem (Exercise 3–8), and describe how it might be used to prove the checkerboard cannot be covered by the tiles as
(a) Long ago, a wicked king was searching for a new wizard with whom to plot some devious schemes. He summoned to him three wizards who seemed especially promising, and let them into a small room,
(a) Present a predicate calculus formalization for the Confusion–of-Patents Problem (Exercise 3–3) and give a resolution-based proof that it is solvable.(b) Use the technique of example
One nice aspect of the PLANNER "robot calculus" is that it allows a relation or a predicate to have a variable number of arguments. Give some real-world examples illustrating such relations.
In the discussion of PLANNER theorems the following statement was presented:∃R∃Y[R(Y,Turing)→ Y (Turing )]Find two English words that might plausibly be substituted for R and Y to makea
Design a computer program that could generate the set of "Crypt Addition" problems. (See Exercise 3–5.)Exercise 3–5Assign a decimal digit to each of the letters in the words "send," "more," and
Consider various methods for making a computer generate English fortunes, such as are found in fortune-cookies. What are the desirable attributes of fortune-cookie fortunes? (Some may claim that a
Show how the following formula (Watanabe, 1969) can be stated in English: Fo = Επι Σ a=1 UE-1 na+1 Ema+2 a"} UE, Σ Πα
Discuss the subproblems that might be considered by a computer program for solving crossword puzzles.
Prove that a string language is of type 0 iff there is a Turing machine that accepts it.
"Hucbald, Abbot of Saint-Amand, wrote a learned and insufferably boring poem, the Eclogia de Calvi, circa 877 A.D., justifying and praising baldness, in which not only the best and greatest men had
Describe how a GQA might be enabled to "learn how to learn."
Prove that an "infinite conflict-of-print-commands" problem cannot arise in an AMS, given that each square of space initially has only a finite number of tapeheads scanning it.
Let A and B be two machines, each engaged in performing some never-ending task, with the additional feature that A is able to scan B, recognize whenever B is not performing correctly, stop B, repair
Define "nondeterministic cellular automata." Show that Checkers, Chess, and GO can be represented by nondeterministic ABCS.
Design some simple self-replicating machines. CAUTION ROBOT VEHICLE