An Introduction to Artificial Intelligence: Can Computers Think? |
From inside the book
Results 1-3 of 36
Page 31
... difficulty in applying this formalism to all kinds of prob- lems in the field of artificial intelligence and decision making . The difficulty is that , in general , it does not yield a feasible ap- proach . Just as enumeration was not ...
... difficulty in applying this formalism to all kinds of prob- lems in the field of artificial intelligence and decision making . The difficulty is that , in general , it does not yield a feasible ap- proach . Just as enumeration was not ...
Page 52
... DIFFICULTIES Let us give two examples of the difficulty : The first is conceptual , when there is only one event , or let us say one trial . Something is going to be done once and only once . What meaning then is there to the average ...
... DIFFICULTIES Let us give two examples of the difficulty : The first is conceptual , when there is only one event , or let us say one trial . Something is going to be done once and only once . What meaning then is there to the average ...
Page 113
... difficulty . Various types of reconciliations have been built up in different regions . He only meets the real difficulty when applications are involved . 8. CONSISTENCY Thus , a desired consistency gives way to utility . By this we ...
... difficulty . Various types of reconciliations have been built up in different regions . He only meets the real difficulty when applications are involved . 8. CONSISTENCY Thus , a desired consistency gives way to utility . By this we ...
Other editions - View all
Common terms and phrases
Academic Press algorithm analog computer analysis answer applications approach approximate policies arithmetic artificial intelligence axioms Bellman BIBLIOGRAPHY AND COMMENTS bility calculus of variations chapter chess COMMENTS Section complex concept consider Control Processes criterion function deal dealer determine device difficulty digital computer discussed dynamic programming effect example experience fast storage feasible fifteen puzzle foregoing functional equation fuzzy human humor idea important instinct interesting involved large number learning levels lever logic machine mathe mathematical analysis mathematical problems mathematical theory mathematician matical means methods minimize minimum multistage decision process observe operation optimal policy paradox particular path patient pattern recognition play player possible precise preprogrammed probability distribution probability theory puter puzzles question reasonable simple simulation situations solve stochastic stochastic approximation structure talking techniques tion transformation uncertainty unknown variables W. V. O. Quine words York Zadeh
References to this book
The Bellman Continuum: A Collection of the Works of Richard E. Bellman Richard Ernest Bellman,Robert S. Roth No preview available - 1986 |