A Computational Model of Routine Procedural Memory

Files in this item

Files Size Format View Description
Signed Title Page.pdf 22.86Kb application/pdf Thumbnail signed title page
tamborello-dissertation.pdf 1.650Mb application/pdf Thumbnail dissertation document (PDF)

Show full item record

Item Metadata

Title: A Computational Model of Routine Procedural Memory
Author: Tamborello, Franklin Patrick II
Advisor: Byrne, Michael D.
Degree: Doctor of Philosophy thesis
Abstract: Cooper and Shallice (2000) implemented a computational version of the Norman and Shallice’s (1986) Contention Scheduling Model (CSM). The CSM is a hierarchically organized network of action schemas and goals. Botvinick and Plaut (2004) instead took a connectionist approach to modeling routine procedural behavior. They argued in favor of holistic, distributed representation of learned step co-occurrence associations. Two experiments found that people can adapt routine procedural behavior to changing circumstances quite readily and that other factors besides statistical co-occurrence can have influence on action selection. A CSM-inspired ACT-R model of the two experiments is the first to postdict differential error rates across multiple between-subjects conditions and trial types. Results from the behavioral and modeling studies favor a CSM-like theory of human routine procedural memory that uses discrete, hierarchically-organized goal and action representations that are adaptable to new but similar procedures.
Citation: Tamborello, Franklin Patrick II. (2009) "A Computational Model of Routine Procedural Memory." Doctoral Thesis, Rice University.
Date: 2009

This item appears in the following Collection(s)