Machine Intelligence and Robotics: Report of the NASA Study Group : Final Report |
From inside the book
Page 407
... 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 will be ...
... 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 will be ...
Page 408
... 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 process which ...
... 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 process which ...
Page 437
... proving these theorems as they are in the general problem of solving difficult problems . The com- binatorial system of Russell and Whitehead ( with which LT deals ) is far less simple and elegant than the system used by Wang . 24 ...
... proving these theorems as they are in the general problem of solving difficult problems . The com- binatorial system of Russell and Whitehead ( with which LT deals ) is far less simple and elegant than the system used by Wang . 24 ...
Page 438
... proving in the predicate cal- culus ( for which exhaustive decision procedures are no longer available ) . We have no space to discuss this area , 25 but it seems clear that a program to solve real mathematical problems will have to ...
... proving in the predicate cal- culus ( for which exhaustive decision procedures are no longer available ) . We have no space to discuss this area , 25 but it seems clear that a program to solve real mathematical problems will have to ...
Page 267
... proving program in logic [ 15 ] , a checker - playing program [ 19 ] , and a pattern recognition program [ 20 ] . These were tasks for which algorithms either did not exist or were so immensely expensive as to preclude their use . Thus ...
... proving program in logic [ 15 ] , a checker - playing program [ 19 ] , and a pattern recognition program [ 20 ] . These were tasks for which algorithms either did not exist or were so immensely expensive as to preclude their use . Thus ...
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