Computer Science @ Marlboro
, Spring 2003
Lecture Notes - Tues Jan 28
Walk through chapter 1
models of microworlds with weak reasoning
Turing Test and attempts
chips vs brains chart (pg 12)
Game theory / payoff matrix / prisnor's dilemma
conditional probability - ask dr math
- as "belief", not frequency counts
Example: spam filter
markov chain and hidden markov model
chain of events where the future depends conditionally only on the present. Example: random walk.
- technical explanation at Brown U
"From the observable sequence [in a Markov chain], infer the most likely dynamical system. The result is a model for the underlying process."
gcl is installed on cs.marlboro.edu
links to resources on the course website
Those interested should start playing around, perhaps with the NYU tutorial.
Last modified: Mon Jan 27 23:15:29 EST 2003