1st and 2nd Annual Symposium on Switching Circuit Theory and Logical Design (SWCT 1960-1961) (1961)
Oct. 17, 1961 to Oct. 20, 1961
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/FOCS.1961.22
We pursue in this paper some of the ideas discussed a year ago at the First Annual Symposium on Switching Theory and Logical Design. For a general discussion of threshold logic, and for definitions and motivations of the terms used below, the reader is referred to "Single Stage Threshold Logic" also published in this volume . Also, a general survey of recent papers in the subject has been published elsewhere . The main subject treated below is compound synthesis. The importance of such a study was shown last year: The family of functions of n arguments realizable in a single stage becomes a vanishing fraction of all switching functions of n arguments as n grows (for n = 7 the ratio is about 1028 1/2). We provide an algorithm for determining "2-realizability" -- reallzability with two threshold elements. The general approach produces a good solution in any case, but one guaranteed optimal only for 2-realizable functions. We use here a geometric terminology; this new language is also used in the second section, where "higher" necessary conditions for realizability are discussed. A conjecture that certain of these conditions might be sufficient is disproved; three related conditions are treated in a common language. The final section considers optimal integral single-stage realizations, and disproves a conjecture made last year: That such a realization gives equal arguments equal weights.
R. O. Winder, "More about threshold logic," 1st and 2nd Annual Symposium on Switching Circuit Theory and Logical Design (SWCT 1960-1961)(FOCS), Detroit, MI, 1961, pp. 55-64.