Academic Commons

Reports

Implementing Descriptions Using Non-Von Neumann Parallelism

Lebowitz, Michael

Parallel processing has the potential for explaining and simplifying the algorithms used in many cognitive processes. One area particularly appropriate for an application of parallelism is memory search. Specifically, it is hard to even imagine one of the most appealing models of memory search that has been presented to date, the descriptions of Norman and Bobrow [Norman and Bobrow 79] being reasonably implemented in a sequential model. We show in this paper how descriptions can be implemented in a most straightforward fashion using a specific parallel architecture, that used by the NON-VON supercomputer [Shaw 82].

Subjects

Files

More About This Work

Academic Units
Computer Science
Publisher
Department of Computer Science, Columbia University
Series
Columbia University Computer Science Technical Reports, CUCS-052-83
Published Here
October 25, 2011
Academic Commons provides global access to research and scholarship produced at Columbia University, Barnard College, Teachers College, Union Theological Seminary and Jewish Theological Seminary. Academic Commons is managed by the Columbia University Libraries.