Machine Intelligence and Robotics: Report of the NASA Study Group : Final Report |
From inside the book
Results 6-10 of 47
Page 407
... theorem proving , pattern recognition , and other do- mains which would seem to require some intelligence . The literature does not include any general discussion of the outstanding problems of this field . In this article , an attempt ...
... theorem proving , pattern recognition , and other do- mains which would seem to require some intelligence . The literature does not include any general discussion of the outstanding problems of this field . In this article , an attempt ...
Page 408
... theorem - proving , or in games with precise rules for play and scoring . In one sense all such problems are trivial . For if there exists a solution to such a problem , that solution can be found eventually by any blind exhaustive ...
... theorem - proving , or in games with precise rules for play and scoring . In one sense all such problems are trivial . For if there exists a solution to such a problem , that solution can be found eventually by any blind exhaustive ...
Page 435
... theorems from old theorems and axioms . The LT program is centered around the idea of " working backward ” to find a proof . Given a theorem T to be proved , LT searches among the axioms and previously established theorems for one from ...
... theorems from old theorems and axioms . The LT program is centered around the idea of " working backward ” to find a proof . Given a theorem T to be proved , LT searches among the axioms and previously established theorems for one from ...
Page 436
... theorems . ( If no more , go to 2. ) Then apply the Method to the problem , using the chosen theorem or axiom . If problem is solved , EXIT with complete proof . If no result , go to 3 . If new subproblem arises , go to 4 . 4. Try the ...
... theorems . ( If no more , go to 2. ) Then apply the Method to the problem , using the chosen theorem or axiom . If problem is solved , EXIT with complete proof . If no result , go to 3 . If new subproblem arises , go to 4 . 4. Try the ...
Page 437
... theorems . ) The authors of " Empirical Explorations of the Logic Theory Machine , " perhaps unaware of the existence of even moderately efficient exhaustive methods , supported their arguments by comparison with a par- ticularly ...
... theorems . ) The authors of " Empirical Explorations of the Logic Theory Machine , " perhaps unaware of the existence of even moderately efficient exhaustive methods , supported their arguments by comparison with a par- ticularly ...
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