An Introduction to Artificial Intelligence: Can Computers Think?

actual algorithm analog computer answer applications approach approximate policies arithmetic artificial intelligence assumptions average outcome axioms behavior Bellman BIBLIOGRAPHY AND COMMENTS bility C. P. Smith chapter chess complex concept consider Control Processes criterion function deal dealer determine deterministic difficulty digital computer discussed draw a card drug dynamic programming effect example expected gain experience experimentation fast storage feasible fifteen puzzle foregoing functional equation fuzzy sets human idea important instinct interesting large number learning levels logic machine mathe mathematical analysis mathematical model mathematical problems mathematical theory mathematician matical mean methods minimize multistage decision processes observe operation optimal play optimal policy paradox particular path patient pattern recognition player possible precise priori probability distribution probability theory procedure puter puzzles question reasonable simple situations solve space stochastic approximation stochastic process structure talk tion transformation uncertainty unknown probability York