Machine Intelligence and Robotics: Report of the NASA Study Group : Final Report |
From inside the book
Results 6-10 of 30
Page 424
... expressions in such languages for purposes of heuristic programming . ( See the remarks at the end of Sec . IV . If ... expression of the form FG where F is an expression which at once denotes the composite relation be- tween all the ...
... expressions in such languages for purposes of heuristic programming . ( See the remarks at the end of Sec . IV . If ... expression of the form FG where F is an expression which at once denotes the composite relation be- tween all the ...
Page 436
... expressions which are probably false and hence not prov- able . In a series of experiments " learning " was used to find which earlier theorems had been most useful and should be given priority in step 3 . We cannot review the effects ...
... expressions which are probably false and hence not prov- able . In a series of experiments " learning " was used to find which earlier theorems had been most useful and should be given priority in step 3 . We cannot review the effects ...
Page 443
... expressions in some formal system . ] If the Characters are taken to be abstract representations of the problem expressions , this " Character- Algebra " model can be as abstract as are the available pattern - recognition facilities ...
... expressions in some formal system . ] If the Characters are taken to be abstract representations of the problem expressions , this " Character- Algebra " model can be as abstract as are the available pattern - recognition facilities ...
Page 444
... expressions ) where we speak of the Character of a single problem . These views are equivalent if we take our problems to be links or connections between expressions . But this notion of Difference ( as the Character of a pair ) does ...
... expressions ) where we speak of the Character of a single problem . These views are equivalent if we take our problems to be links or connections between expressions . But this notion of Difference ( as the Character of a pair ) does ...
Page 445
... expressions have many levels of descriptive detail , the matrix powers will too swiftly become de- generate . This degeneracy will ultimately limit the capacity of any formal planning device . One may think of the general planning ...
... expressions have many levels of descriptive detail , the matrix powers will too swiftly become de- generate . This degeneracy will ultimately limit the capacity of any formal planning device . One may think of the general planning ...
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