Machine Intelligence and Robotics: Report of the NASA Study Group : Final Report |
From inside the book
Results 11-15 of 32
Page 277
... proving , mostly logic , synthetic geometry , and various elementary algebraic systems ; all kinds of puzzles ; a range of management science tasks , including line balancing , production sched- uling , and warehouse location ; question ...
... proving , mostly logic , synthetic geometry , and various elementary algebraic systems ; all kinds of puzzles ; a range of management science tasks , including line balancing , production sched- uling , and warehouse location ; question ...
Page 283
... proving theorems and doing other mathe- matics , matching shows up in tasks that seem remote from this discipline . One of them , as shown below , is inducing a pattern from a part . Another use is in answering questions in quasi ...
... proving theorems and doing other mathe- matics , matching shows up in tasks that seem remote from this discipline . One of them , as shown below , is inducing a pattern from a part . Another use is in answering questions in quasi ...
Page 287
... proving programs make use of this method , as well as many of the management science applications [ 13 ] .5 Figure 10.8 gives the most elementary variant of the method . It as- sumes a space of elements , the problem space , which ...
... proving programs make use of this method , as well as many of the management science applications [ 13 ] .5 Figure 10.8 gives the most elementary variant of the method . It as- sumes a space of elements , the problem space , which ...
Page 289
... proving for heuristic search . First , the problem has to be turned around , so that LT works backward from the original goal toward the given theorems . Thus the rules of inference must be expressed in an inverse sense . Second , the ...
... proving for heuristic search . First , the problem has to be turned around , so that LT works backward from the original goal toward the given theorems . Thus the rules of inference must be expressed in an inverse sense . Second , the ...
Page 320
... PROVING Analysis of Algorithms. 1 . INTRODUCTION Can we ever hope to understand the nature of intelli- gence in the same sense that we understand , say , the nature of flight ? Will our understanding of intel- ligence ever be sufficient ...
... PROVING Analysis of Algorithms. 1 . INTRODUCTION Can we ever hope to understand the nature of intelli- gence in the same sense that we understand , say , the nature of flight ? Will our understanding of intel- ligence ever be sufficient ...
Other editions - View all
Common terms and phrases
algorithms Allen Newell analysis applications areas Artificial Intelligence automated base basic behavior capabilities centers complex computer programs computer science computer systems concepts Conf construction cost DENDRAL devices discussion domain elements engineering environment example existing experience exploration Feigenbaum Figure functions GAME goal hardware heuristic programming heuristic search human hypotheses ill-structured problems inference information processing input intelligence and robotics interaction knowledge learning logic machine intelligence man-machine systems manipulators Marvin Minsky mathematical mechanisms memory ment methods Minsky mission operations MYCIN NASA NASA's Natural Language Newell Papers 3d Intl pattern recognition performance planetary planning problem solving problem space problem statement Proc procedure processor Project Project MAC PSYC psychology representation rover rules sensors sequence Simon simplex method solution solver spacecraft Stanford Research Institute Stanford Univ structure Study Group subproblems symbolic task Tech techniques TEIRESIAS teleoperator theory tion