Fast automated counting procedures in addition problem solving : when are they used and why are they mistaken for retrieval ?
Details
Serval ID
serval:BIB_7971B825C87A
Type
Article: article from journal or magazin.
Collection
Publications
Institution
Title
Fast automated counting procedures in addition problem solving : when are they used and why are they mistaken for retrieval ?
Journal
Cognition
ISSN-L
1873-7838
Publication state
Published
Issued date
01/2016
Volume
146
Pages
289-303
Language
english
Abstract
Contrary to a widespread assumption, a recent study suggested that adults do not solve very small additions by directly retrieving their answer from memory, but rely instead on highly automated and fast counting procedures (Barrouillet & Thevenot, 2013). The aim of the present study was to test the hypothesis that these automated compiled procedures are restricted to small quantities that do not exceed the size of the focus of attention (i.e., 4 elements). For this purpose, we analyzed the response times of ninety adult participants when solving the 81 additions with operands from 1 to 9. Even when focusing on small problems (i.e. with sums ⩽10) reported by participants as being solved by direct retrieval, chronometric analyses revealed a strong size effect. Response times increased linearly with the magnitude of the operands testifying for the involvement of a sequential multistep procedure. However, this size effect was restricted to the problems involving operands from 1 to 4, whereas the pattern of response times for other small problems was compatible with a retrieval hypothesis. These findings suggest that very fast responses routinely interpreted as reflecting direct retrieval of the answer from memory actually subsume compiled automated procedures that are faster than retrieval and deliver their answer while the subject remains unaware of their process, mistaking them for direct retrieval from long-term memory.
Keywords
arithmetic, association, numerical cognition, problem solving, retrieval
Pubmed
Create date
05/11/2015 11:11
Last modification date
17/01/2022 16:58