Machine Intelligence and Robotics: Report of the NASA Study Group : Final Report |
From inside the book
Page 409
... Heuristic Connections A problem can hardly come to interest us if we have no background of information about it . We usually have some basis , however flimsy , for de- tecting improvement ; some trials will be judged more successful ...
... Heuristic Connections A problem can hardly come to interest us if we have no background of information about it . We usually have some basis , however flimsy , for de- tecting improvement ; some trials will be judged more successful ...
Page 411
... heuristic connection . Certainly , in our own intellectual behavior we rarely solve a tricky prob- lem by a steady climb toward success . I doubt that in any one simple mechanism , e.g. , hill - climbing , will we find the means to ...
... heuristic connection . Certainly , in our own intellectual behavior we rarely solve a tricky prob- lem by a steady climb toward success . I doubt that in any one simple mechanism , e.g. , hill - climbing , will we find the means to ...
Page 412
... heuristic program is bound to contain a variety of different methods and techniques . At each step of the problem - solving process the machine will have to decide what aspect of the problem to work on , and then which method to use . A ...
... heuristic program is bound to contain a variety of different methods and techniques . At each step of the problem - solving process the machine will have to decide what aspect of the problem to work on , and then which method to use . A ...
Page 413
... heuristic connection which links the old to the new , can make learning broadly useful . What is a " pattern " ? We often use the term teleologically to mean a set of objects which can in some ( useful ) way be treated alike . For each ...
... heuristic connection which links the old to the new , can make learning broadly useful . What is a " pattern " ? We often use the term teleologically to mean a set of objects which can in some ( useful ) way be treated alike . For each ...
Page 415
... heuristic connection on the space of transformations . Further- more , for each defined pattern , the system has to be presented with a proto- type . But if one has in mind a fairly abstract class , one may simply be unable to represent ...
... heuristic connection on the space of transformations . Further- more , for each defined pattern , the system has to be presented with a proto- type . But if one has in mind a fairly abstract class , one may simply be unable to represent ...
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