Abstract A circuit is described for which the interconnections may be established to reflect a particular instance of the 3-Satisfiability problem. Analysis of the circuit reveals that it can proceed from an unbiased starting state to a stable state which can be interpreted as a satisfying truth value assignment for the 3-Satisfiability problem, if such an assignment exists. This stable configuration represents the global minimum of an energy function. While no analytic evidence is presented to guarantee that the trajectory does not become trapped in a local minimum, supporting empirical evidence is cited which indicates that it does not. Finally, it is shown that the network scales polynomially with respect to the size of the 3-Satisfiability problem both in circuit hardware and in convergence time. The relevance of this phenomenon to the P = NP question is discussed.
[2]
D. O. Hebb,et al.
The organization of behavior
,
1988
.
[3]
F ROSENBLATT,et al.
The perceptron: a probabilistic model for information storage and organization in the brain.
,
1958,
Psychological review.
[4]
J J Hopfield,et al.
Neurons with graded response have collective computational properties like those of two-state neurons.
,
1984,
Proceedings of the National Academy of Sciences of the United States of America.
[5]
J. J. Hopfield,et al.
Learning algorithms andprobability distributions infeed-forward andfeed-back networks
,
1987
.
[6]
J J Hopfield,et al.
Neural networks and physical systems with emergent collective computational abilities.
,
1982,
Proceedings of the National Academy of Sciences of the United States of America.