Machine Intelligence and Robotics: Report of the NASA Study Group : Final Report |
From inside the book
Results 6-10 of 28
Page 432
... inferences ; and so on . The amount of informa- tion relevant to learning increases directly with the number of mecha- nisms in the chess - playing machine.20 We are in complete agreement with Newell on this approach to the problem.21 ...
... inferences ; and so on . The amount of informa- tion relevant to learning increases directly with the number of mecha- nisms in the chess - playing machine.20 We are in complete agreement with Newell on this approach to the problem.21 ...
Page 435
... inference ; the latter specify how certain transformations can be applied to produce new theorems from old theorems and axioms . The LT program is centered around the idea of " working backward " to find a proof . Given a theorem T to ...
... inference ; the latter specify how certain transformations can be applied to produce new theorems from old theorems and axioms . The LT program is centered around the idea of " working backward " to find a proof . Given a theorem T to ...
Page 436
... inference ) . If one is found , the problem is solved . Or the search might fail completely . But finally , the search may yield one or more " problems " which are usually propositions from which T may be deduced directly . If one of ...
... inference ) . If one is found , the problem is solved . Or the search might fail completely . But finally , the search may yield one or more " problems " which are usually propositions from which T may be deduced directly . If one of ...
Page 442
... inference . And even if the plan fails , it may be possible to patch it by replacing just a few of its steps . Another aid to planning is the semantic , as opposed to the homomor- phic , model ( Minsky , 1956a , 1959a ) . Here we may ...
... inference . And even if the plan fails , it may be possible to patch it by replacing just a few of its steps . Another aid to planning is the semantic , as opposed to the homomor- phic , model ( Minsky , 1956a , 1959a ) . Here we may ...
Page 447
... machines do not have minds ) do not assure us against this . Turing ( 1956 ) gives a very knowledgeable discussion of such matters . B. Inductive Inference Let us pose now for our machines B - 42 STEPS TOWARD ARTIFICIAL INTELLIGENCE 447 42.
... machines do not have minds ) do not assure us against this . Turing ( 1956 ) gives a very knowledgeable discussion of such matters . B. Inductive Inference Let us pose now for our machines B - 42 STEPS TOWARD ARTIFICIAL INTELLIGENCE 447 42.
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