Machine Intelligence and Robotics: Report of the NASA Study Group : Final Report |
From inside the book
Results 11-15 of 56
Page 435
... solution , by machine , of really complex problems will require a variety of administration facilities . During the course of solving a problem , one becomes involved with a large assembly of interrelated subproblems . From these , at ...
... solution , by machine , of really complex problems will require a variety of administration facilities . During the course of solving a problem , one becomes involved with a large assembly of interrelated subproblems . From these , at ...
Page 438
... solution promote the main goal , and ( 2 ) its apparent " difficulty " -how much effort is it liable to consume . We need heuristic methods to estimate each of , these quantities and , further , to " See Davis and Putnam ( 1960 ) , and ...
... solution promote the main goal , and ( 2 ) its apparent " difficulty " -how much effort is it liable to consume . We need heuristic methods to estimate each of , these quantities and , further , to " See Davis and Putnam ( 1960 ) , and ...
Page 441
... solution to some other problem , as suggested in the GPS proposal ( Newell , Shaw and Simon , 1959a ) . In any case , this part of the machine's behavior , regarded from the outside , can be treated as a sort of stimulus - response , or ...
... solution to some other problem , as suggested in the GPS proposal ( Newell , Shaw and Simon , 1959a ) . In any case , this part of the machine's behavior , regarded from the outside , can be treated as a sort of stimulus - response , or ...
Page 442
... solution of complex problems.31 Note that even if one encountered , say , 10 ° fail- ures of such procedures before success , one would still have gained a fac- tor of perhaps 1010 in over - all trial reduction ! Thus practically any ...
... solution of complex problems.31 Note that even if one encountered , say , 10 ° fail- ures of such procedures before success , one would still have gained a fac- tor of perhaps 1010 in over - all trial reduction ! Thus practically any ...
Page 445
... solution of the problem.33 Evidently , the success of this " means - end " analysis in reducing general search will depend on the degree of specificity that can be written into the Difference - Method table - basically the same ...
... solution of the problem.33 Evidently , the success of this " means - end " analysis in reducing general search will depend on the degree of specificity that can be written into the Difference - Method table - basically the same ...
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