Chen Yalin, Campbell Jamie I D
Department of Psychology, University of Saskatchewan.
J Exp Psychol Learn Mem Cogn. 2016 Apr;42(4):627-35. doi: 10.1037/xlm0000196. Epub 2015 Oct 12.
There is a renewed debate about whether educated adults solve simple addition problems (e.g., 2 + 3) by direct fact retrieval or by fast, automatic counting-based procedures. Recent research testing adults' simple addition and multiplication showed that a 150-ms preview of the operator (+ or ×) facilitated addition, but not multiplication, suggesting that a general addition procedure was primed by the + sign. In Experiment 1 (n = 36), we applied this operator-priming paradigm to rule-based problems (0 + N = N, 1 × N = N, 0 × N = 0) and 1 + N problems with N ranging from 0 to 9. For the rule-based problems, we found both operator-preview facilitation and generalization of practice (e.g., practicing 0 + 3 sped up unpracticed 0 + 8), the latter being a signature of procedure use; however, we also found operator-preview facilitation for 1 + N in the absence of generalization, which implies the 1 + N problems were solved by fact retrieval but nonetheless were facilitated by an operator preview. Thus, the operator preview effect does not discriminate procedure use from fact retrieval. Experiment 2 (n = 36) investigated whether a population with advanced mathematical training-engineering and computer science students-would show generalization of practice for nonrule-based simple addition problems (e.g., 1 + 4, 4 + 7). The 0 + N problems again presented generalization, whereas no nonzero problem type did; but all nonzero problems sped up when the identical problems were retested, as predicted by item-specific fact retrieval. The results pose a strong challenge to the generality of the proposal that skilled adults' simple addition is based on fast procedural algorithms, and instead support a fact-retrieval model of fast addition performance.
关于受过教育的成年人解决简单加法问题(如2 + 3)是通过直接提取事实还是通过快速、基于自动计数的程序,存在新的争论。最近一项测试成年人简单加法和乘法的研究表明,对运算符(+或×)进行150毫秒的预呈现促进了加法运算,但没有促进乘法运算,这表明加法的一般程序是由+号启动的。在实验1(n = 36)中,我们将这种运算符启动范式应用于基于规则的问题(0 + N = N,1 × N = N,0 × N = 0)以及N取值范围为0到9的1 + N问题。对于基于规则的问题,我们发现了运算符预呈现促进效应以及练习的泛化(例如,练习0 + 3加快了未练习的0 + 8的运算速度),后者是使用程序的一个特征;然而,我们还发现在没有泛化的情况下1 + N也存在运算符预呈现促进效应,这意味着1 + N问题是通过提取事实来解决的,但仍然受到运算符预呈现的促进。因此,运算符预呈现效应无法区分程序使用和事实提取。实验2(n = 36)调查了具有高等数学训练的人群——工程和计算机科学专业的学生——是否会对非基于规则的简单加法问题(如1 + 4,4 + 7)表现出练习的泛化。0 + N问题再次呈现出泛化现象,而其他非零问题类型则没有;但正如特定项目事实提取所预测的那样,当对相同问题进行重新测试时,所有非零问题的运算速度都加快了。这些结果对熟练成年人的简单加法基于快速程序算法这一观点的普遍性提出了强有力的挑战,相反,支持了快速加法表现的事实提取模型。