Neural Computations That Support Long Mixed Sequences of Knowledge Acquisition Tasks

摘要

In this talk we shall first give a brief review of a quantitative approach to understanding neural computation [4-6]. We target so-called random access tasks, denned as those in which one instance of a task execution may need to access arbitrary combinations of items in memory. Such tasks are communication intensive, and therefore the known severe constraints on connectivity in the brain can inform their analysis.