Relating Boltzmann machines to conventional models of computation

Abstract It is shown that clocked Boltzmann machines are not much more powerful than combinational circuits built from gates which compute Boolean threshold functions and their negations. More formally, any clocked Boltzmann machine can be simulated by a threshold circuit with running time greater by a constant factor and size greater by a polynomial.

[1]  Uzi Vishkin,et al.  Simulation of Parallel Random Access Machines by Circuits , 1984, SIAM J. Comput..

[2]  Geoffrey E. Hinton,et al.  Learning and relearning in Boltzmann machines , 1986 .

[3]  Svatopluk Poljak,et al.  On periodical behaviour in societies with symmetric influences , 1983, Comb..

[4]  John E. Savage,et al.  Computational Work and Time on Finite Machines , 1972, JACM.

[5]  Walter L. Ruzzo.  On Uniform Circuit Complexity , 1981, J. Comput. Syst. Sci..

[6]  Leslie G. Valiant,et al.  A Scheme for Fast Parallel Communication , 1982, SIAM J. Comput..

[7]  Georg Schnitger,et al.  Parallel Computation with Threshold Functions , 1988, J. Comput. Syst. Sci..

[8]  H. Chernoff.  A Measure of Asymptotic Efficiency for Tests of a Hypothesis Based on the sum of Observations , 1952 .

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

[10]  C. D. Gelatt,et al.  Optimization by Simulated Annealing , 1983, Science.

[11]  Nicholas Pippenger,et al.  On simultaneous resource bounds , 1979, 20th Annual Symposium on Foundations of Computer Science (sfcs 1979).

[12]  Uzi Vishkin,et al.  Constant Depth Reducibility , 1984, SIAM J. Comput..

[13]  Ian Parberry.  An Improved Simulation of Space and Reversal Bounded Deterministic Turing Machines by Width and Depth Bounded Uniform Circuits , 1987, Inf. Process. Lett..

[14]  Leslie G. Valiant,et al.  Fast probabilistic algorithms for hamiltonian circuits and matchings , 1977, STOC '77.

[15]  Ian Parberry,et al.  On the Construction of Parallel Computers from Various Bases of Boolean Functions , 1986, Theor. Comput. Sci..

[16]  Noga Alon.  Asynchronous threshold networks , 1985, Graphs Comb..

[17]  Michael Luby,et al.  A simple parallel algorithm for the maximal independent set problem , 1985, STOC '85.

[18]  Georg Schnitger,et al.  Parallel Computation with Threshold Functions , 1986, J. Comput. Syst. Sci..

[19]  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.

[20]  Saburo Muroga,et al.  Threshold logic and its applications , 1971 .

[21]  Geoffrey E. Hinton,et al.  A Learning Algorithm for Boltzmann Machines , 1985, Cogn. Sci..

[22]  Leonard M. Adleman,et al.  Two theorems on random polynomial time , 1978, 19th Annual Symposium on Foundations of Computer Science (sfcs 1978).

[23]  Jia-Wei Hong.  On connectionist models , 1988 .