Answers are grounded in this paper and cite their sources.
The underlying logical structure of parallel-search memories is described; the characteristic operation of three major types is displayed in the execution of searches based on equality; and algorithms are presented for searches based on other specifications including maximum, miniTnum, greater than, less than, nearest to, between limits, and ordering (sorting). It is shown that there is a hierarchy of dependency among these algorithms, that they appear in pairs with each member of a pair belonging to one or the other of two distinct classes, and that every type of search can be executed within each class.
No takes yet. Share an insight, caveat, or question.
Adin D. Falkoff (1962) studied this question.
Synapse has enriched 10 related papers. Consider them for comparative context: