• DocumentCode
    3501089
  • Title

    Evolving recurrent neural networks are super-Turing

  • Author

    Cabessa, Jérémie ; Siegelmann, Hava T.

  • Author_Institution
    Comput. Sci. Dept., Univ. of Massachusetts Amherst, Amherst, MA, USA
  • fYear
    2011
  • fDate
    July 31 2011-Aug. 5 2011
  • Firstpage
    3200
  • Lastpage
    3206
  • Abstract
    The computational power of recurrent neural networks is intimately related to the nature of their synaptic weights. In particular, neural networks with static rational weights are known to be Turing equivalent, and recurrent networks with static real weights were proved to be super-Turing. Here, we study the computational power of a more biologically-oriented model where the synaptic weights can evolve rather than stay static. We prove that such evolving networks gain a super-Turing computational power, equivalent to that of static real-weighted networks, regardless of whether their synaptic weights are rational or real. These results suggest that evolution might play a crucial role in the computational capabilities of neural networks.
  • Keywords
    Turing machines; recurrent neural nets; biologically-oriented model; recurrent neural networks; static rational weights; static real-weighted networks; super-turing computational power; synaptic weights; turing equivalent; Biological neural networks; Complexity theory; Computational modeling; Neurons; Polynomials; Recurrent neural networks; Turing machines;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    Neural Networks (IJCNN), The 2011 International Joint Conference on
  • Conference_Location
    San Jose, CA
  • ISSN
    2161-4393
  • Print_ISBN
    978-1-4244-9635-8
  • Type

    conf

  • DOI
    10.1109/IJCNN.2011.6033645
  • Filename
    6033645