Machine Intelligence and Robotics: Report of the NASA Study Group : Final Report |
From inside the book
Results 16-20 of 32
Page 417
... sequence of the elementary transforma- tions , followed by a terminal operation , defines a property . [ Dineen ( 1955 ) describes how these processes were programmed in a digital computer . ] We can start with a few short sequences ...
... sequence of the elementary transforma- tions , followed by a terminal operation , defines a property . [ Dineen ( 1955 ) describes how these processes were programmed in a digital computer . ] We can start with a few short sequences ...
Page 418
... sequences has worked . It has seemed to us that this is the crucial point of learning . It would indeed be remarkable if this failed to yield properties more useful than would be obtained from completely random sequence selection . The ...
... sequences has worked . It has seemed to us that this is the crucial point of learning . It would indeed be remarkable if this failed to yield properties more useful than would be obtained from completely random sequence selection . The ...
Page 425
... sequence of problems to parallel a process of maturation of the machine's resources . In order to solve a new problem one uses what might be called the basic learning heuristic - first try using methods similar to those which have ...
... sequence of problems to parallel a process of maturation of the machine's resources . In order to solve a new problem one uses what might be called the basic learning heuristic - first try using methods similar to those which have ...
Page 428
... sequences on which our machines will spend their infancies , so to speak , must be chosen very shrewdly to insure that early abstractions will provide a good founda- tion for later difficult problems . Incidentally , in spite of the ...
... sequences on which our machines will spend their infancies , so to speak , must be chosen very shrewdly to insure that early abstractions will provide a good founda- tion for later difficult problems . Incidentally , in spite of the ...
Page 433
... sequences " as described in the following section . FRIEDBERG'S PROGRAM - WRITING PROGRAM An important example of ... sequence of modifications in the program generator and its reinforcement operators . With these , and with some ...
... sequences " as described in the following section . FRIEDBERG'S PROGRAM - WRITING PROGRAM An important example of ... sequence of modifications in the program generator and its reinforcement operators . With these , and with some ...
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