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].



More About This Work

Academic Units
Computer Science
Department of Computer Science, Columbia University
Columbia University Computer Science Technical Reports, CUCS-052-83
Published Here
October 25, 2011