Machine Intelligence and Robotics: Report of the NASA Study Group : Final Report |
From inside the book
Results 1-5 of 30
Page 412
We should not be surprised , then , to find ourselves using inverse or teleological expressions to define the classes . We really do want to have a grip on “ the class of objects which can be transformed into a result of form Y , ” that ...
We should not be surprised , then , to find ourselves using inverse or teleological expressions to define the classes . We really do want to have a grip on “ the class of objects which can be transformed into a result of form Y , ” that ...
Page 416
They are instead very rudimentary forms of description ( having the form of the simplest symbolic expression — the list ) whose structure provides some information about the designated classes . This is a step , albeit a small one ...
They are instead very rudimentary forms of description ( having the form of the simplest symbolic expression — the list ) whose structure provides some information about the designated classes . This is a step , albeit a small one ...
Page 418
Solomonoff ( 1957 , 1960 ) proposes some techniques for discovering common features of a set of expressions , e.g. , of the descriptions of those properties of already established utility ; the methods can then be applied to generate ...
Solomonoff ( 1957 , 1960 ) proposes some techniques for discovering common features of a set of expressions , e.g. , of the descriptions of those properties of already established utility ; the methods can then be applied to generate ...
Page 420
Note that the logarithm of the coefficient Piilqis in the second expression of ( 1 ) can be construed as the " weight of the evidence ” of E in favor of Fg . ( See also Papert ( 1961 ) and Rosenblatt ( 1958 ) . ) These nets resemble the ...
Note that the logarithm of the coefficient Piilqis in the second expression of ( 1 ) can be construed as the " weight of the evidence ” of E in favor of Fg . ( See also Papert ( 1961 ) and Rosenblatt ( 1958 ) . ) These nets resemble the ...
Page 423
We can formalize this kind of description in an expression language whose fundamental grammatical form is a pair ( RL ) ... originally by Newell , Shaw and Simon , for manipulating symbolic expressions in such languages for purposes of B ...
We can formalize this kind of description in an expression language whose fundamental grammatical form is a pair ( RL ) ... originally by Newell , Shaw and Simon , for manipulating symbolic expressions in such languages for purposes of B ...
What people are saying - Write a review
We haven't found any reviews in the usual places.
Other editions - View all
Common terms and phrases
activities analysis applications approach areas Artificial Intelligence automated automatic base become behavior called centers complex computer science concept concerned construction cost described devices direct discussion domain elements engineering environment example existing experience exploration expressions field Figure functions GAME given goal Group heuristic human important increase interest knowledge language learning limited machine intelligence major manipulators mathematical mechanisms memory methods mission NASA nature Newell objects operations organization performance planning position possible present problem solving Proc procedure processing produce Project properties proving psychology reasoning represent representation robot rules selected sequence simple solution space spacecraft specific Stanford step structure Study success symbolic task techniques theorem theory tion understanding Univ University York