Machine Intelligence and Robotics: Report of the NASA Study Group : Final Report |
From inside the book
Results 1-5 of 41
Page 333
2 C. Combinatorial and Scheduling Problems 3 D. Automatic Programming 3 E. Expert Consulting Systems 4 4 F. Natural Language Processing G. Intelligent Retrieval from Databases 4 H. Theorem Proving 5 5 I. Social Impact 1 .
2 C. Combinatorial and Scheduling Problems 3 D. Automatic Programming 3 E. Expert Consulting Systems 4 4 F. Natural Language Processing G. Intelligent Retrieval from Databases 4 H. Theorem Proving 5 5 I. Social Impact 1 .
Page 340
The task of writing a computer program is also related to other areas of Al . Much of the basis research in automatic programming , theorem proving , and robot problem solving overlaps . In a sense , existing compilers already do ...
The task of writing a computer program is also related to other areas of Al . Much of the basis research in automatic programming , theorem proving , and robot problem solving overlaps . In a sense , existing compilers already do ...
Page 342
H. Theorem Proving There is little evidence for the thesis that job satisfaction has declined in recent years , or that the alienation of workers has increased . Hence , such trends , being nonexistent , cannot be attributed to ...
H. Theorem Proving There is little evidence for the thesis that job satisfaction has declined in recent years , or that the alienation of workers has increased . Hence , such trends , being nonexistent , cannot be attributed to ...
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 ...
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 ...
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 basic become behavior called centers complex computer science concepts concerned construction cost described devices discussion domain elements engineering environment example existing experience exploration expressions field Figure functions given goal Group heuristic human important increase information processing interest knowledge language learning limited lines machine intelligence major manipulators 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