Machine Intelligence and Robotics: Report of the NASA Study Group : Final Report |
From inside the book
Results 6-10 of 39
Page 409
... defined . No goal is defined . But if the comparator - defined relation between trials is " transitive " ( i.e , if A dominates B and B dominates C implies that A dominates C ) , then we can at least define " progress , " and ask our ...
... defined . No goal is defined . But if the comparator - defined relation between trials is " transitive " ( i.e , if A dominates B and B dominates C implies that A dominates C ) , then we can at least define " progress , " and ask our ...
Page 412
... defined only with respect to the environments to be encountered by the machine , and with respect to the methods available to it . Distinctions which cannot be exploited are not worth recognizing . And methods are usually worthless ...
... defined only with respect to the environments to be encountered by the machine , and with respect to the methods available to it . Distinctions which cannot be exploited are not worth recognizing . And methods are usually worthless ...
Page 415
... defined pattern , the system has to be presented with a proto- type . But if one has in mind a fairly abstract class , one may simply be unable to represent its essential features with one or a very few concrete examples . How could one ...
... defined pattern , the system has to be presented with a proto- type . But if one has in mind a fairly abstract class , one may simply be unable to represent its essential features with one or a very few concrete examples . How could one ...
Page 416
... define P * [ F ] to be AVERAGE ( P [ F ] ) . Then we have a new property P * whose values are independent of the selection of F from an equivalence class defined by the transforma- tions . We have to be sure that when different ...
... define P * [ F ] to be AVERAGE ( P [ F ] ) . Then we have a new property P * whose values are independent of the selection of F from an equivalence class defined by the transforma- tions . We have to be sure that when different ...
Page 417
... defines a property . [ Dineen ( 1955 ) describes how these processes were programmed in a digital computer . ] We ... definition ] not B - 12 STEPS TOWARD ARTIFICIAL INTELLIGENCE 417.
... defines a property . [ Dineen ( 1955 ) describes how these processes were programmed in a digital computer . ] We ... definition ] not B - 12 STEPS TOWARD ARTIFICIAL INTELLIGENCE 417.
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