University of Lausanne, Institute of Psychology, Switzerland.
University of Lausanne, Institute of Psychology, Switzerland.
Neuropsychologia. 2021 Mar 12;153:107771. doi: 10.1016/j.neuropsychologia.2021.107771. Epub 2021 Feb 4.
Using ERP, we investigated the cause of the tie advantage according to which problems with repeated operands are solved faster and more accurately than non-tie problems. We found no differences in early or N400 ERP components between problems, suggesting that tie problems are not encoded faster or suffer from less interference than non-tie problems. However, a lesser negative amplitude of the N2 component was found for tie than non-tie problems. This suggests more working-memory and attentional resource requirements for non-tie problems and therefore more frequent use of retrieval for tie than non-tie problems. The possible peculiarity of problems involving a 1 was also investigated. We showed less negative N2 amplitudes for these problems than for other non-tie problems, suggesting less working-memory resources for 1-problems than other non-tie problems. This could be explained either by higher reliance on memory retrieval for 1-problems than non-1 problems or by the application of non-arithmetical rules for 1-problems.
使用 ERP，我们根据重复操作数问题比非关联问题解决得更快、更准确的优势，研究了关联优势的原因。我们发现问题之间在早期或 N400 ERP 成分上没有差异，这表明关联问题的编码速度不会更快，也不会受到比非关联问题更少的干扰。然而，我们发现关联问题的 N2 成分的负振幅比非关联问题小。这表明非关联问题需要更多的工作记忆和注意力资源，因此关联问题比非关联问题更频繁地使用检索。我们还研究了涉及 1 的问题的特殊性。与其他非关联问题相比，我们发现这些问题的 N2 振幅更小，这表明 1-问题比其他非关联问题需要更少的工作记忆资源。这可能是由于 1-问题比非 1-问题更依赖于记忆检索，或者由于 1-问题应用了非算术规则。
