Computational Theories of Classical Conditioning

2002 
Computational theories of classical conditioning are theories whose propositions are stated as mathematical relationships. From such propositions one can compute, that is to say, deduce, presumed consequences for conditioned responding in circumstances addressed by the theory. This chapter is an attempt to roughly categorize and briefly summarize the major computational theories that have been developed to understand behavior in classical conditioning. It is organized around the essential ideas about conditioning that the various theories embrace. This chapter is not intended to provide a relative evaluation of the theories mentioned; to do so is considerably beyond the scope of what can be accomplished in the space available. Data are mentioned and judgments made, but only to provide understanding of the inspiration for the different models.
    • Correction
    • Source
    • Cite
    • Save
    • Machine Reading By IdeaReader
    226
    References
    15
    Citations
    NaN
    KQI
    []