Skip to main content
Log in

Switch costs and the operand-recognition paradigm

  • Original Article
  • Published:
Psychological Research Aims and scope Submit manuscript

Abstract

Experimental research in cognitive arithmetic frequently relies on participants’ self-reports to discriminate solutions based on direct memory retrieval from use of procedural strategies. Given concerns about the validity and reliability of strategy reports, Thevenot et al. in Mem Cogn 35:1344–1352, (2007) developed the operand-recognition paradigm as an objective measure of arithmetic strategies. Participants performed addition or number comparison on two sequentially presented operands followed by a speeded operand-recognition task. Recognition times increased with problem size following addition but not comparison. Thevenot et al. argued that the complexity of addition strategies increases with problem size. A corresponding increase in operand-recognition time occurs because, as problem size increases, working memory contains more numerical distracters. However, because addition is substantially more difficult than comparison, and difficulty increases with problem size for addition but not comparison, their findings could be due to difficulty-related task-switching costs. We repeated Thevenot et al. (Experiment 1) but added a control condition wherein participants performed a parity (odd or even) task instead of operand recognition. We replicated their findings for operand recognition but found robust, albeit smaller, effects of addition problem size on parity judgements. The results indicate that effects of strategy complexity in the operand-recognition paradigm are confounded with task-switching effects, which complicates its application as a precise measure of strategy complexity in arithmetic.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Fig. 1
Fig. 2
Fig. 3

Similar content being viewed by others

Notes

  1. An earlier experiment in our lab found no switch costs using a letter-comparison control task in which participants decided if a presented letter preceded or followed the letter E. This was a poor task-switch control, however, because the numerical task set (i.e., addition or number comparison) would not compete with letter comparison. In contrast, like operand recognition, parity judgments following addition or comparison required participants to switch number-processing task sets.

  2. For the problem pair 7 5, Task 2 trials were always paired with a false comparison due to a coding error; this affected 0.01% of Task 2 trials and had no practical consequences for the recognition or parity tasks. Also, because false Task 2 addition answers were ±1 from the correct sum participants could use addition parity rules to solve Task 2 addition problems (Lemaire and Reder 1999). Future research might wish to avoid this possibility, but the current experiment was designed to be a close replication of Thevenot et al. (2007, Experiment 1) and adopted their rules for false answer stimuli.

  3. We refer to the component stages of addition and comparison as Task 1 and Task 2, but because the Task 2 decision stage necessarily refers to the processes and representations generated during Task 1, it is reasonable to assume that they constitute an integrated task set and that task difficulty is properly indexed by total solution time (i.e., Task 1 + Task 2 RT).

  4. As the parity task did not afford analysis in terms of first versus second operand we did not include this as a factor in our main analysis.

References

  • Allport, A., Styles, E. A., & Hsieh, S. (1994). Shifting intentional set: Exploring the dynamic control of tasks. In C. Umilta & M. Moscovitch (Eds.), Attention and performance (pp. 421–452). Cambridge, MA: MIT Press.

    Google Scholar 

  • Arbuthnott, K. D. (2008). Asymmetric switch cost and backward inhibition: Carryover activation and inhibition in switching between tasks of unequal difficulty. Canadian Journal of Experimental Psychology, 62, 91–100.

    PubMed  Google Scholar 

  • Ashcraft, M. H. (1995). Cognitive psychology and simple arithmetic: A review and summary of new directions. Mathematical Cognition, 1, 3–34.

    Google Scholar 

  • Campbell, J. I. D., & Metcalfe, A. W. S. (2008). Arabic digit naming speed: Task context and redundancy gain. Cognition, 107, 218–237.

    Article  PubMed  Google Scholar 

  • Campbell, J. I. D., & Xue, Q. (2001). Cognitive arithmetic across cultures. Journal of Experimental Psychology: General, 130, 299–315.

    Article  Google Scholar 

  • Clapp, F. L. (1924). The number combinations: Their relative difficulty and the frequency of their appearance in textbooks. University of Wisconsin Bureau of Educational Research, Bulletin No. 2.

  • Cohen, L., & Dehaene, S. (1995). Number processing in pure alexia: The effect of hemispheric asymmetries and task demands. Neurocase, 1, 121–137.

    Article  Google Scholar 

  • Imbo, I., Vandierendonck, A., & Rosseel, Y. (2007). The influence of problem features and individual differences on strategic performance in simple arithmetic. Memory and Cognition., 35, 454–463.

    Google Scholar 

  • Kirk, E. P., & Ashcraft, M. H. (2001). Telling stories: The perils and promise of using verbal reports to study math strategies. Journal of Experimental Psychology. Learning, Memory, and Cognition, 27, 157–175.

    Article  PubMed  Google Scholar 

  • LeFevre, J.-A., Sadesky, G. S., & Bisanz, J. (1996). Selection of procedures in mental addition: Reassessing the problem size effect in adults. Journal of Experimental Psychology. Learning, Memory, and Cognition, 22, 216–230.

    Article  Google Scholar 

  • Lemaire, P., & Reder, L. (1999). What affects strategy selection in arithmetic? The example of parity and five effects on product verification. Memory and Cognition, 22, 364–382.

    Google Scholar 

  • Monsell, S. (2003). Task switching. Trends in Cognitive Sciences, 7, 134–140.

    Article  PubMed  Google Scholar 

  • Monsell, S., Sumner, P., & Waters, H. (2003). Task-set reconfiguration with predictable and unpredictable task switches. Memory and Cognition, 31, 327–342.

    Google Scholar 

  • Monsell, S., Yeung, N., & Azuma, R. (2000). Reconfiguration of task-set: Is it easier to switch to the weaker task? Psychological Research, 63, 250–264.

    Article  PubMed  Google Scholar 

  • Thevenot, C., Barrouillet, P., & Fayol, M. (2001). Algorithmic solution of arithmetic problems and operands–answer associations in LTM. Quarterly Journal of Experimental Psychology, 54A, 599–611.

    Article  Google Scholar 

  • Thevenot, C., Fanget, M., & Fayol, M. (2007). Retrieval or nonretrieval strategies in mental arithmetic? An operand recognition paradigm. Memory and Cognition, 35, 1344–1352.

    Google Scholar 

  • Yeung, N., & Monsell, S. (2003). Switching between tasks of unequal familiarity: The role of stimulus-attribute and response-set selection. Journal of Experimental Psychology: Human Perception and Performance, 29, 455–489.

    Article  PubMed  Google Scholar 

  • Zbrodoff, N. J., & Logan, G. D. (2005). What everyone finds: The problem size effect. In J. I. D. Campbell (Ed.), Handbook of mathematical cognition (pp. 331–346). New York: Psychology Press.

    Google Scholar 

Download references

Acknowledgments

This research was supported by a grant and scholarship from the Natural Sciences and Engineering Research Council of Canada.

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Arron W. S. Metcalfe.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Metcalfe, A.W.S., Campbell, J.I.D. Switch costs and the operand-recognition paradigm. Psychological Research 74, 491–498 (2010). https://doi.org/10.1007/s00426-009-0272-9

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s00426-009-0272-9

Keywords

Navigation