On Autonomous Logic Nets of Threshold Elements

Abstract—A model of autonomous logic nets composed of n threshold elements is presented and several properties of a single threshold element are generalized to this model. The number of these nets is shown to be 2kn³(½≤k≤l) for completely specified machines. The capacity of the net is defined and conjectured to be 2, similar to the case of a single threshold element. P and NPN classifications of the machines are proposed and applied to the enumeration of all periodic sequences of length 2n(n≤4) realizable by this net. The state assignment problem of the net is also treated. The existence of transition diagrams which cannot be realized by this model for any state assignment, or of those that can be realized for any state assignment, is shown, and it turns out that almost all completely specified machines belong to the former class when n is sufficiently large. Considering the synthesis of a net, an application of learning procedure is also discussed and it is pointed out that only periodic sequences of length 2" can be learned automatically.

[1]  Robert O. Winder,et al.  Single stage threshold logic , 1961, SWCT.

[2]  Calvin C. Elgot,et al.  Truth functions realizable by single threshold organs , 1961, SWCT.

[3]  S. Muroga,et al.  Theory of majority decision elements , 1961 .

[4]  Eiichi Goto,et al.  Some Theorems Useful in Threshold Logic for Enumerating Boolean Functions , 1962, IFIP Congress.

[5]  Robert O. Winder,et al.  Bounds on Threshold Gate Realizability , 1963, IEEE Transactions on Electronic Computers.

[6]  Saburo Muroga.  Functional forms of dual-comparable functions and a necessary and sufficient condition for readability of a majority function , 1964, IEEE Transactions on Communication and Electronics.

[7]  Thomas M. Cover,et al.  Geometrical and Statistical Properties of Systems of Linear Inequalities with Applications in Pattern Recognition , 1965, IEEE Trans. Electron. Comput..

[8]  Robert O. Winder,et al.  Enumeration of Seven-Argument Threshold Functions , 1965, IEEE Trans. Electron. Comput..

[9]  John L. Rhodes,et al.  Nets of Threshold Elements , 1965, Inf. Control..

[10]  Charles H. Gustafson,et al.  Synthesis of counters with threshold elements , 1965, SWCT.

[11]  C. L. Coates,et al.  Realization of Sequential Machines with Threshold Elements , 1966, SWAT.

[12]  David R. Smith,et al.  Bounds on the Number of Threshold Functions , 1966, IEEE Trans. Electron. Comput..

[13]  Saburo Muroga,et al.  Lower Bound of the Number of Threshold Functions , 1966, IEEE Trans. Electron. Comput..