Machine Intelligence and Robotics: Report of the NASA Study Group : Final Report |
From inside the book
Results 6-10 of 41
Page 375
Design faults : prove correctness of programs and mathematical models for software reliability and prediction ( both are in the research stage ) ; “ software engineering ” techniques include procedures for the collection and analysis of ...
Design faults : prove correctness of programs and mathematical models for software reliability and prediction ( both are in the research stage ) ; “ software engineering ” techniques include procedures for the collection and analysis of ...
Page 399
His research interests in computer science are in artificial intelligence , automatic theorem proving , and database systems . He is a member of the Association for Computing Machinery , SIAM , and IEEE . He is on the editorial boards ...
His research interests in computer science are in artificial intelligence , automatic theorem proving , and database systems . He is a member of the Association for Computing Machinery , SIAM , and IEEE . He is on the editorial boards ...
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 .
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 lines 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