Abraham Waksman

Learn More
In this paper the construction of a switching network capable of <italic>n</italic>!-permutation of its <italic>n</italic> input terminals to its <italic>n</italic> output terminals is described. The building blocks for this network are binary cells capable of permuting their two input terminals to their two output terminals. The number of cells used by the(More)
A<lb>theoretical model of a<lb>microprogram unit is<lb>formulated,<lb>and the relationship of this model to a form of feedback shift register<lb>is<lb>developed. The feedback<lb>shift-register machine variant has syn-<lb>chronous and asynchronous prototypes. The asynchronous binary feed-<lb>back<lb>shift-register machines realize every fundamental mode(More)
Theorem 1 and Corollaries t and 2 (pp. 159, 160) are correct, as egm be verified from the given constructive proof (p. HiD. However, the proof given for Theorem 1 is in error, since it does not run through all subsets of the n elements. T h e author credits Jim Turner with the discovery of the error.
Almost all intelligent computer systems of the past decade could be characterized by the General Problem Solver (GPS) paradigm. This paradigm states that the intelligent system activity consists of two distinct elements considered as separate modules. The first module is the generalist, the general problem solver while the second module could be considered(More)