How does running memory span work?

Abstract

In running memory span, a list ends unpredictably, and the last few items are to be recalled. This task is of increasing importance in recent research. We argue that there are two very different strategies for performing running span tasks: a low-effort strategy in which items are passively held until the list ends, when retrieval into a capacity-limited store takes place; and a higher-effort strategy in which working memory is continually updated using rehearsal processes during the list presentation. In two experiments, we examine the roles of these two strategies and the consequences of two types of interference.