Machine Intelligence and Robotics: Report of the NASA Study Group : Final Report |
From inside the book
Results 1-5 of 37
Page 406
Some would be proving mathematical theorems of rather undistinguished character . A few machines might be playing certain games , occasionally defeating their designers . Some might be distinguishing between hand - printed letters ...
Some would be proving mathematical theorems of rather undistinguished character . A few machines might be playing certain games , occasionally defeating their designers . Some might be distinguishing between hand - printed letters ...
Page 407
Quite a number of papers have appeared describing theories or actual computer programs concerned with game playing , theorem proving , pattern recognition , and other domains which would seem to require some intelligence .
Quite a number of papers have appeared describing theories or actual computer programs concerned with game playing , theorem proving , pattern recognition , and other domains which would seem to require some intelligence .
Page 408
Most of the experimental work discussed here is concerned with such well - defined problems as are met in theorem - proving , or in games with precise rules for play and scoring . In one sense all such problems are trivial .
Most of the experimental work discussed here is concerned with such well - defined problems as are met in theorem - proving , or in games with precise rules for play and scoring . In one sense all such problems are trivial .
Page 428
Samuel's program is at present the outstanding example of a game - playing program which matches a average human ability , and its success ( in real time ) is attributed to a wealth of such elegancies , both in heuristics and in ...
Samuel's program is at present the outstanding example of a game - playing program which matches a average human ability , and its success ( in real time ) is attributed to a wealth of such elegancies , both in heuristics and in ...
Page 430
Let us review very briefly the situation in playing two - person board games of this kind . As noted by Shannon ( 1956 ) such games are in principle finite , and a best strategy can be found by following out all possible continuations ...
Let us review very briefly the situation in playing two - person board games of this kind . As noted by Shannon ( 1956 ) such games are in principle finite , and a best strategy can be found by following out all possible continuations ...
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
Bibliographic information
| Title | Machine Intelligence and Robotics: Report of the NASA Study Group : Final Report |
| Author | NASA Study Group on Machine Intelligence and Robotics |
| Contributor | United States. National Aeronautics and Space Administration |
| Publisher | National Aeronautics and Space Administration, 1980 |
| Original from | Indiana University |
| Digitized | 29 Nov 2012 |
| Length | 400 pages |
| Export Citation | BiBTeX EndNote RefMan |