Skip to main content

On the computational efficiency of symmetric neural networks

  • Communications
  • Conference paper
  • First Online:
Mathematical Foundations of Computer Science 1989 (MFCS 1989)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 379))

Abstract

An open problem concerning the computational power of neural networks with symmetric weights is solved. It is shown that these networks possess the same computational power as general networks with asymmetric weights — i.e. these networks can compute any recursive function. The computations of these networks can be described as a minimization process of a certain energy function; it is shown that for uninitialized symmetric neural networks this process presents a PSPACE-complete problem.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Ackley, D. N.-Hinton, G. E.-Sejnowski, T. I.: A Learning Algorithm for Boltzmann Machines. Cognitive Science 9, 1985, pp. 147–169

    Google Scholar 

  2. Barahona, F.: On the Computational Complexity of Ising Spin Glass Models. J. Phys. A. 15, 1982, pp. 3241–3253

    Google Scholar 

  3. Chandra, A. K.-Stockmeyer, L. I.-Vishkin, U.: Constant Depth Reducibility. SIAM J. Comput. Vol. 15, No. 3, 1984, pp. 423–432

    Google Scholar 

  4. Egecioglu, O.-Smith, T. R.-Moody, I.: Computable Functions and Complexity in Neural Networks. Tech. Rep. ITP-124, University of California, Santa Barbara, 1986

    Google Scholar 

  5. Feldman, J. A.: Energy and the Behavior of Connectionist Models. Tech. Rep. TR-155, University of Rochester, Nov. 1985

    Google Scholar 

  6. Hopfield, J. J.: Neural Networks and Physical Systems with Emergent Collective Computational Abilities. Proc. Natl. Acad. Sci. U.S.A. 79, 1982, pp. 2554–2558

    Google Scholar 

  7. Hopfield, J. J.: Neurons with Graded Response Have Collective Computational Properties Like Those of Two-state Neurons. Proc. Natl. Acad. Sci. U.S.A., 1984, pp. 3088–3092

    Google Scholar 

  8. Hopfield, J. J.-Tank, D. W.: ”Neural” Computations of Decisions in Optimization Problems. Biol. Cybern. 52, 1985, pp. 141–152

    Google Scholar 

  9. Minsky, M.: Computation. Finite and Infinite Machines. Prentice Hall, Englewood Cliffs, NJ, 1967

    Google Scholar 

  10. Parberry, I.-Schnitger, G.: Parallel Computation with Threshold Functions. JCSS 36, 1988, pp. 278–302

    Google Scholar 

  11. Robson, J. M.: Linear Size Formulas for Non-deterministic Single Tape Computations. Proc. 11-th Australian Comp. Sci. Conference, Brisbane, Feb. 3–5, 1988

    Google Scholar 

  12. van Emde Boas, P.: Machine Models and Simulations. ITLI Prepublication Series of Computation and Complexity Theory CT-88-95, University of Amsterdam, 1988

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Antoni Kreczmar Grazyna Mirkowska

Rights and permissions

Reprints and permissions

Copyright information

© 1989 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Wiedermann, J. (1989). On the computational efficiency of symmetric neural networks. In: Kreczmar, A., Mirkowska, G. (eds) Mathematical Foundations of Computer Science 1989. MFCS 1989. Lecture Notes in Computer Science, vol 379. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-51486-4_100

Download citation

  • DOI: https://doi.org/10.1007/3-540-51486-4_100

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-51486-2

  • Online ISBN: 978-3-540-48176-8

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics