Machine Intelligence and Robotics: Report of the NASA Study Group : Final Report |
From inside the book
Results 1-5 of 24
Page 408
... chess , or nontrivial parts of mathematics , are too complicated for complete analysis . Without complete analysis , there must always re- main some core of search , or " trial and error . " So we need to find tech- niques through which ...
... chess , or nontrivial parts of mathematics , are too complicated for complete analysis . Without complete analysis , there must always re- main some core of search , or " trial and error . " So we need to find tech- niques through which ...
Page 431
... chess has the order of 1010 branches - beyond the reach of any man or computer . There is a fundamental heuristic exchange between the effectiveness of the evaluation function and the extent of the tree . A very weak evaluation ( e.g. ...
... chess has the order of 1010 branches - beyond the reach of any man or computer . There is a fundamental heuristic exchange between the effectiveness of the evaluation function and the extent of the tree . A very weak evaluation ( e.g. ...
Page 432
... chess or checkers , or in writing a com- puter program , one has a definite success criterion - the game is won or lost . But in the course of play , each ultimate success ( or failure ) is asso- ciated with a vast number of internal ...
... chess or checkers , or in writing a com- puter program , one has a definite success criterion - the game is won or lost . But in the course of play , each ultimate success ( or failure ) is asso- ciated with a vast number of internal ...
Page 433
... chess game ) . Could we assign to each decision element one - millionth of the credit for the completed task ? In certain special situa- tions we can do just this - e.g . , in the machines of Rosenblatt ( 1958 ) , Roberts ( 1960 ) , and ...
... chess game ) . Could we assign to each decision element one - millionth of the credit for the completed task ? In certain special situa- tions we can do just this - e.g . , in the machines of Rosenblatt ( 1958 ) , Roberts ( 1960 ) , and ...
Page 441
... chess by Newell , Shaw , and Simon ( 1958b ) we have a form of Inheritance method with a non- numerical stop condition . Here , the subproblems inherit sets of goals to be achieved . This teleological control has to be administered by ...
... chess by Newell , Shaw , and Simon ( 1958b ) we have a form of Inheritance method with a non- numerical stop condition . Here , the subproblems inherit sets of goals to be achieved . This teleological control has to be administered by ...
Other editions - View all
Common terms and phrases
algorithms Allen Newell analysis applications areas Artificial Intelligence automated base basic behavior Chart chess complex computer science concepts Conf construction DENDRAL domain element engineering example experience Feigenbaum Feldman Figure function GAME generate-and-test goal H. A. Simon heuristic programming heuristic search human hypotheses ill-structured problems inference Information Processing input intelligence and robotics INTERLISP knowledge logic Logic Theorist machine intelligence manipulators mathematical mechanisms Memo memory methods Michie Minsky mission operations MYCIN NASA NASA's Natural Language Newell ORGANISM-1 Papers 3d Intl pattern recognition performance problem solving problem space problem statement Proc procedure Project Project MAC PSYC psychology representation rover rules Semantic sensors sequence Simon simplex method Slagle solution solver spacecraft Stanford Research Institute Stanford Univ structure Study Group symbolic task Tech techniques TEIRESIAS teleoperator theorem proving theory tion variables York