首页> 外文期刊>Psychological Research >Is there a structural limit to ‘branch’ recursively between more than two tasks?
【24h】

Is there a structural limit to ‘branch’ recursively between more than two tasks?

机译:在两个以上的任务之间递归“分支”是否存在结构性限制?

获取原文
获取原文并翻译 | 示例
       

摘要

The term ‘branching’ refers to processes needed for successful reuptake of a task after interruption by another task. Based on a model of human prefrontal cognitive architecture, it has been postulated that people cannot branch recursively between more than two tasks due to a capacity limit built into the cognitive architecture (Koechlin and Hyafil in Science 318:594–598, 2007). As an alternative to a structural limit for recursive branching between more than two tasks we put forward the hypothesis that working memory capacity is the limiting factor in recursive branching. We tested this hypothesis by independently varying working memory load and number of recursive branching steps. Successful branching between up to four tasks was observed, as long as working memory load was kept low. Our data, thus, do not support the proposition of a structural limit to recursive branching beyond two tasks. Instead, they suggest that working memory capacity limit is the most important factor that limits the capacity for branching. We further observed that the requirement to retain task sets and task contents additively contributed to the difficulty of recursive branching. In a broader context, our data thus support working memory models that conceptualize working memory and executive functions not as separate modules, but as tightly interactive processes.
机译:“分支”一词是指在被另一个任务中断后成功重接一个任务所需的过程。基于人类前额认知结构的模型,假设由于认知结构中内置的容量限制,人们无法在两个以上的任务之间进行递归分支(Koechlin和Hyafil,Science 318:594–598,2007)。作为对两个以上任务之间递归分支的结构性限制的替代方案,我们提出了以下假设:工作内存容量是递归分支的限制因素。我们通过独立地更改工作内存负载和递归分支步骤的数量来检验此假设。只要保持较低的工作内存负载,就可以在多达四个任务之间成功进行分支。因此,我们的数据不支持递归分支超出两个任务的结构性限制。相反,他们建议工作内存容量限制是限制分支容量的最重要因素。我们进一步观察到,保留任务集和任务内容的需求加重了递归分支的难度。因此,在更广泛的范围内,我们的数据支持工作记忆模型,该模型将工作记忆和执行功能概念化为不独立的模块,而是紧密交互的过程。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号