Issue No. 01 - January (1968 vol. 17)
David R. Smith , Dept. of Electrical Sciences, State university of New York, Stony Brook, N. Y. 11790
A method of network synthesis for general combinational functions that uses a number of fixed threshold logic units not greatly in excess of the theoretical minimum is described. It can be used with adaptive logic in which case a minority of the interconnections are simply adapted once according to the rule originally suggested by Hebb. This network on its own has no capacity for ``generalization,'' and if used for pattern recognition must therefore be operated in conjunction with a suitable property filter, such as that of the previous paper.[<sup>1</sup>] In this case the present network could perform as a trainable ``categorizer.''
D. R. Smith, "A Partitioning Method for Combinational Synthesis," in IEEE Transactions on Computers, vol. 17, no. , pp. 72-75, 1968.