Abstract—A number of techniques exist for realizing completely symmetric switching functions.1 Completely symmetric switching functions are particularly simple and economical to realize using contact-type gating elements. This paper shows that any switching function can be transformed to a completely symmetric switching function in which some of the arguments are redundant. (Obviously, if a given function is already completely symmetric no transformation is necessary.) The partial symmetry information inherent in a given function plays an important role in the transformation. Efficient machine-oriented methods exist for detecting the partial symmetries present in a switching function.

This paper presents an elementary computer memory organization capable of direct representation and manipulation of simple linear lists. A conventional random-access memory is used in conjunction with a group of address and word-length registers to store and manipulate single-link list words. Four typical list-processing macroinstructions, INSERT, DELETE, SEARCH, and EXECUTE, are illustrated and a sequence of microsteps for accomplishing each is given.