Skip to main content
SpringerLink
Log in

Turing universality of neural nets (revisited)

  • 4 Intelligent Systems
  • Conference paper
  • First Online:
Computer Aided Systems Theory — EUROCAST'97 (EUROCAST 1997)

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

Included in the following conference series:

Abstract

We show how to use recursive function theory to prove Turing universality of finite analog recurrent neural nets, with a piecewise linear sigmoid function as activation function. We emphasize the modular construction of nets within nets, a relevant issue from the software engineering point of view.

This work was supported by JNICT PBIC/TIT/2527/95 and a fellowship from the Gobierno Autonomo de Canarias.

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

Access this chapter

Log in via an institution

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. BOOLOS, G. and JEFFREY, R., Computability and Logic, (2° Ed), Cambridge University Press, 1980.

    Google Scholar 

  2. H.SIEGELMANN and E.SONTAG, “Neural Nets are Universal Computing Devices”. SYCON Report 91-08, Rutgers University, 1991.

    Google Scholar 

  3. H.SIEGELMANN and E.SONTAG, “On the Computational Power of Neural Nets”, in Journal of Computer and System Science [50] 1, Academic Press, 1995.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Faculdade de Ciěncias da Universidade de Lisboa, Bloco C5 - Piso 1, 1700, Lisboa, Portugal

    J. Pedro Neto & J. Félix Costa

  2. Faculty of Industrial Engineering and Management, Technion City, 32 000, Haifa, Israel

    Hava T. Siegelmann

  3. Dpt. of Computer Sciences and Systems. Univ. of Las Palmas de G.C., Campus Universitario de Tafira, 35017, Las Palmas de G.C., Spain

    C. P. Suárez Araujo

Authors
  1. J. Pedro Neto
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Hava T. Siegelmann
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. J. Félix Costa
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. C. P. Suárez Araujo
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Franz Pichler Roberto Moreno-Díaz

Rights and permissions

Reprints and permissions

Copyright information

© 1997 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Neto, J.P., Siegelmann, H.T., Costa, J.F., Araujo, C.P.S. (1997). Turing universality of neural nets (revisited). In: Pichler, F., Moreno-Díaz, R. (eds) Computer Aided Systems Theory — EUROCAST'97. EUROCAST 1997. Lecture Notes in Computer Science, vol 1333. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0025058

Download citation

  • DOI: https://doi.org/10.1007/BFb0025058

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-63811-7

  • Online ISBN: 978-3-540-69651-3

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation