Questions and Answers of Introduction To Artificial Intelligence

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

Showing 200 - 300 of 216

1
2
3