[go: up one dir, main page]
More Web Proxy on the site http://driver.im/ Skip to main content

Advertisement

Springer Nature Link
Log in

Hybrid networks of evolutionary processors are computationally complete

  • Published:
Acta Informatica Aims and scope Submit manuscript

    We’re sorry, something doesn't seem to be working properly.

    Please try refreshing the page. If that doesn't work, please contact support so we can address the problem.

Abstract.

A hybrid network of evolutionary processors (an HNEP) consists of several language processors which are located in the nodes of a virtual graph and able to perform only one type of point mutations (insertion, deletion, substitution) on the words found in that node, according to some predefined rules. Each node is associated with an input and an output filter, defined by some random-context conditions. After applying in parallel a point mutation to all the words existing in every node, the new words which are able to pass the output filter of the respective node navigate simultaneously through the network and enter those nodes whose input filter they are able to pass. We show that even the so-called elementary HNEPs are computationally complete. In this case every node is able to perform only one instance of the specified operation: either an insertion, or a deletion, or a substitution of a certain symbol. We also prove that in the case of non-elementary networks, any recursively enumerable language over a common alphabet can be obtained with an HNEP whose underlying structure is a fixed graph depending on the common alphabet only.

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

Access this article

Log in via an institution

Subscribe and save

Springer+ Basic
£29.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Price includes VAT (United Kingdom)

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. Castellanos, J., Martín-Vide, C., Mitrana, V., Sempere, J. (2001) Solving NP-complete problems with networks of evolutionary processors. In: Mira, J., Prieto, A., (eds.) IWANN 2001 (LNCS 2084). Springer, Berlin Heidelberg New York, pp. 621-628

  2. Castellanos, J., Martín-Vide, C., Mitrana, V., Sempere, J. (2003) Networks of evolutionary processors. Acta Inf. 39: 517-529

    Google Scholar 

  3. Csuhaj-Varj\’ u, E., Salomaa, A. (1997) Networks of parallel language processors. In: Păun, Gh., Salomaa, A. (eds.) New trends in formal languages (LNCS 1218). Springer, Berlin Heidelberg New York, pp. 299-318

  4. Csuhaj-Varj\’ u, E., Mitrana, V. (2000) Evolutionary systems: a language generating device inspired by evolving communities of cells. Acta Inf. 36: 913-926

    Google Scholar 

  5. Errico, L., Jesshope, C. (1994) Towards a new architecture for symbolic processing. In: Plander, I. (ed.) Artificial intelligence and information-control systems of robots ‘94. World Sci. Publ., Singapore, pp. 31-40

  6. Fahlman, S.E., Hinton, G.E., Seijnowski, T.J. (1983) Massively parallel architectures for AI: NETL, THISTLE and Boltzmann machines. Proc. AAAI National Conf. on AI, William Kaufman, Los Altos, pp. 109-113

    Google Scholar 

  7. Geffert, V. (1991) Normal forms for phrase-structure grammars. RAIRO/Theoretical Informatics and Applications 25(5): 473-496

    Google Scholar 

  8. Kari, L., Păun, Gh., Thierrin, G., Yu, S. (1997) At the crossroads of DNA computing and formal languages: Characterizing RE using insertion-deletion systems. Proc. 3rd DIMACS Workshop on DNA Based Computing, Philadelphia, pp. 318-333

    Google Scholar 

  9. Kari, L., Thierrin, G. (1996) Contextual insertion/deletion and computability. Inf. Comput. 131(1): 47-61

    Google Scholar 

  10. Hillis, W.D. (1985) The connection machine. MIT Press, Cambridge

  11. Martín-Vide, C., Păun, Gh., Salomaa, A. (1998) Characterizations of recursively enumerable languages by means of insertion grammars. Theoretical Computer Science 205(1-2): 195-205

    Google Scholar 

  12. Martín-Vide, C., Mitrana, V., Perez-Jimenez, M., Sancho-Caparrini, F. (2003) Hybrid networks of evolutionary processors. Proc. of GECCO 2003, LNCS 2723, pp. 401-412

  13. Sankoff, D. et al. (1992) Gene order comparisons for phylogenetic inference: Evolution of the mitochondrial genome. Proc. Natl. Acad. Sci. USA 89: 6575-6579

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Computer and Automation Research Institute, Hungarian Academy of Sciences, Kende u. 13-17, 1111, Budapest, Hungary

    Erzsébet Csuhaj-Varjú

  2. Research Group in Mathematical Linguistics, Rovira i Virgili University, Pça. Imperial Tárraco 1, 43005, Tarragona, Spain

    Carlos Martín-Vide & Victor Mitrana

Authors
  1. Erzsébet Csuhaj-Varjú
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Carlos Martín-Vide
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Victor Mitrana
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Erzsébet Csuhaj-Varjú.

Additional information

Received: 19 July 2004, Published online: 19 January 2005

Erzsébet Csuhaj-Varjú: Work supported in part by a grant from the NATO Scientific Committee in Spain and the Hungarian Scientific Research Fund “OTKA” Grant No. T 042529

Victor Mitrana: Work supported by the Centre of Excellence in Information Technology, Computer Science and Control, ICA1-CT-2000-70025, HUN-TING project, WP5.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Csuhaj-Varjú, E., Martín-Vide, C. & Mitrana, V. Hybrid networks of evolutionary processors are computationally complete. Acta Informatica 41, 257–272 (2005). https://doi.org/10.1007/s00236-004-0158-7

Download citation

  • Issue Date:

  • DOI: https://doi.org/10.1007/s00236-004-0158-7

Keywords

Search

Navigation