Machine Intelligence and Robotics: Report of the NASA Study Group : Final Report |
From inside the book
Results 11-15 of 32
Page 429
... described here ) , external signals come to produce rein- forcement signals like those that have frequently succeeded them in the past . Such signals might be abstract , e.g. , verbal encouragement . If the " secondary reinforcement ...
... described here ) , external signals come to produce rein- forcement signals like those that have frequently succeeded them in the past . Such signals might be abstract , e.g. , verbal encouragement . If the " secondary reinforcement ...
Page 433
... described in the following section . FRIEDBERG'S PROGRAM - WRITING PROGRAM An important example of comparative failure in this credit - assignment matter is provided by the program of Friedberg ( 1958 , 1959 ) to solve program - writing ...
... described in the following section . FRIEDBERG'S PROGRAM - WRITING PROGRAM An important example of comparative failure in this credit - assignment matter is provided by the program of Friedberg ( 1958 , 1959 ) to solve program - writing ...
Page 437
... described briefly in Sec . IVD2 . Wang ( 1960 ) has criticized the LT project on the grounds that there exist , as he and others have shown , mechanized proof methods which , for the particular run of problems considered , use far less ...
... described briefly in Sec . IVD2 . Wang ( 1960 ) has criticized the LT project on the grounds that there exist , as he and others have shown , mechanized proof methods which , for the particular run of problems considered , use far less ...
Page 439
... described in Shannon ( 1955 ) which describes quite a variety of interesting game - playing and learning machines ] to play a variant of the game marketed as " Hex " ( and known among mathematicians as " Nash " ) . The initial board ...
... described in Shannon ( 1955 ) which describes quite a variety of interesting game - playing and learning machines ] to play a variant of the game marketed as " Hex " ( and known among mathematicians as " Nash " ) . The initial board ...
Page 440
... described in the text . The remaining move pairs ( if both players use that strategy ) would be ( 5 , 8 ) ( 9 , 13 ) ( 12 , 10 or 2 ) ( 2 or 10 win ) . In this game the first player should be able to force a win , and the maximum ...
... described in the text . The remaining move pairs ( if both players use that strategy ) would be ( 5 , 8 ) ( 9 , 13 ) ( 12 , 10 or 2 ) ( 2 or 10 win ) . In this game the first player should be able to force a win , and the maximum ...
Other editions - View all
Common terms and phrases
algorithms Allen Newell analysis applications areas Artificial Intelligence automated basic behavior capabilities centers chess complex computer science computer systems concept 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 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 space missions spacecraft specific Stanford Research Institute Stanford Univ structure Study Group subproblems symbolic task Tech techniques TEIRESIAS teleoperator theory tion