Bajic Daniel, Rickard Timothy C
Department of Psychology, University of California, San Diego, La Jolla, CA 92093, USA.
J Exp Psychol Learn Mem Cogn. 2009 Jan;35(1):113-21. doi: 10.1037/a0013647.
The transition from algorithmic to memory-based performance is a core component of cognitive skill learning. There has been debate about the temporal dynamics of strategy execution, with some models assuming a race (i.e., independent, capacity unconstrained parallel processing) between algorithm and retrieval, and others assuming a choice mechanism. The authors investigated this issue using a new approach that allows the latency of each algorithm step to be measured, in turn providing new insight into (a) whether there is slowing of 1 or more algorithm steps on trials immediately preceding the 1st retrieval trial for an item, as might be expected if there is a competitive strategy execution process of some type other than a race, and (b) whether there is partial algorithm completion on retrieval trials, as would be expected if the 2 strategies are executed in parallel. Results are uniquely consistent with a strategy choice mechanism involving a competition between the retrieval strategy and the 1st step of the algorithm.
从基于算法的表现向基于记忆的表现转变是认知技能学习的核心组成部分。关于策略执行的时间动态存在争议,一些模型假设算法与检索之间存在竞争(即独立的、容量无限制的并行处理),而另一些模型则假设存在一种选择机制。作者使用一种新方法对这一问题进行了研究,该方法能够测量每个算法步骤的延迟,进而为以下两个方面提供了新的见解:(a) 在某个项目的首次检索试验之前的试验中,是否有一个或多个算法步骤的速度减慢,这可能是如果存在某种非竞争类型的竞争策略执行过程时所预期的;(b) 在检索试验中是否存在部分算法完成情况,这是如果两种策略并行执行时所预期的。结果唯一地与一种策略选择机制相一致,该机制涉及检索策略与算法第一步之间的竞争。