Advertisement

Acta Informatica

, Volume 41, Issue 4–5, pp 257–272 | Cite as

Hybrid networks of evolutionary processors are computationally complete

  • Erzsébet Csuhaj-VarjúEmail author
  • Carlos Martín-Vide
  • Victor Mitrana
Article

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.

Keywords

Information System Operating System Data Structure Communication Network Information Theory 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 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-628Google Scholar
  2. 2.
    Castellanos, J., Martín-Vide, C., Mitrana, V., Sempere, J. (2003) Networks of evolutionary processors. Acta Inf. 39: 517-529Google Scholar
  3. 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-318Google Scholar
  4. 4.
    Csuhaj-Varj\’ u, E., Mitrana, V. (2000) Evolutionary systems: a language generating device inspired by evolving communities of cells. Acta Inf. 36: 913-926Google Scholar
  5. 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-40Google Scholar
  6. 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-113Google Scholar
  7. 7.
    Geffert, V. (1991) Normal forms for phrase-structure grammars. RAIRO/Theoretical Informatics and Applications 25(5): 473-496Google Scholar
  8. 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-333Google Scholar
  9. 9.
    Kari, L., Thierrin, G. (1996) Contextual insertion/deletion and computability. Inf. Comput. 131(1): 47-61Google Scholar
  10. 10.
    Hillis, W.D. (1985) The connection machine. MIT Press, CambridgeGoogle Scholar
  11. 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-205Google Scholar
  12. 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-412Google Scholar
  13. 13.
    Sankoff, D. et al. (1992) Gene order comparisons for phylogenetic inference: Evolution of the mitochondrial genome. Proc. Natl. Acad. Sci. USA 89: 6575-6579Google Scholar

Copyright information

© Springer-Verlag Berlin/Heidelberg 2005

Authors and Affiliations

  • Erzsébet Csuhaj-Varjú
    • 1
    Email author
  • Carlos Martín-Vide
    • 2
  • Victor Mitrana
    • 2
  1. 1.Computer and Automation Research InstituteHungarian Academy of SciencesBudapestHungary
  2. 2.Research Group in Mathematical LinguisticsRovira i Virgili UniversityTarragonaSpain

Personalised recommendations