Hostname: page-component-77f85d65b8-pztms Total loading time: 0 Render date: 2026-03-27T09:09:20.671Z Has data issue: false hasContentIssue false

Set size slope still does not distinguish parallel from serial search

Published online by Cambridge University Press:  24 May 2017

Daniel R. Little
Affiliation:
Melbourne School of Psychological Sciences, The University of Melbourne, Parkville VIC 3010 Australia; daniel.little@unimelb.edu.au http://www.psych.unimelb.edu.au/people/daniel-little
Ami Eidels
Affiliation:
School of Psychology, The University of Newcastle, Callaghan NSW 2308; ami.eidels@newcastle.edu.au http://www.newcl.org/eidels
Joseph W. Houpt
Affiliation:
Department of Psychology, Wright State University, Dayton, OH 45435-0001; joseph.houpt@wright.edu http://www.wright.edu/~joseph.houpt/
Cheng-Ta Yang
Affiliation:
Department of Psychology, National Cheng Kung University, Tainan City 701, Taiwan (R.O.C.). yangct@mail.ncku.edu.tw http://vcmlab.psychology.ncku.edu.tw/vcmlab/

Abstract

Much of the evidence for theories in visual search (including Hulleman & Olivers' [H&O's]) comes from inferences made using changes in mean RT as a function of the number of items in a display. We have known for more than 40 years that these inferences are based on flawed reasoning and obscured by model mimicry. Here we describe a method that avoids these problems.

Information

Type
Open Peer Commentary
Copyright
Copyright © Cambridge University Press 2017 

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)

Article purchase

Temporarily unavailable