Skip to main content

Filter Position in Networks of Evolutionary Processors Does Not Matter: A Direct Proof

  • Conference paper

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 5877))

Abstract

In this paper we give a direct proof of the fact that the computational power of networks of evolutionary processors and that of networks of evolutionary processors with filtered connections is the same. It is known that both are equivalent to Turing machines. We propose here a direct simulation of one device by the other. Each computational step in one model is simulated in a constant number of computational steps in the other one while a translation via Turing machines squares the time complexity.

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

Buying options

Chapter
USD   29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Bottoni, P., Labella, A., Mitrana, V., Sempere, J.: Networks of evolutionary picture processors (submitted)

    Google Scholar 

  2. Drăgoi, C., Manea, F., Mitrana, V.: Accepting networks of evolutionary processors with filtered connections. Journal of Universal Computer Science 13, 1598–1614 (2007)

    Google Scholar 

  3. Drăgoi, C., Manea, F.: On the descriptional complexity of accepting networks of evolutionary processors with filtered connections. International Journal of Foundations of Computer Science 19, 1113–1132 (2008)

    Article  MATH  MathSciNet  Google Scholar 

  4. Errico, L., Jesshope, C.: Towards a new architecture for symbolic processing. In: Artificial Intelligence and Information-Control Systems of Robots 1994, pp. 31–40. World Scientific, Singapore (1994)

    Google Scholar 

  5. Hillis, W.: The Connection Machine. MIT Press, Cambridge (1985)

    Google Scholar 

  6. Manea, F., Martin-Vide, C., Mitrana, V.: On the size complexity of universal accepting hybrid networks of evolutionary processors. Mathematical Structures in Computer Science 17, 753–771 (2007)

    Article  MATH  MathSciNet  Google Scholar 

  7. Margenstern, M., Mitrana, V., Perez-Jimenez, M.: Accepting hybrid networks of evolutionary systems. In: Ferretti, C., Mauri, G., Zandron, C. (eds.) DNA 2004. LNCS, vol. 3384, pp. 235–246. Springer, Heidelberg (2005)

    Google Scholar 

  8. Martín-Vide, C., Mitrana, V.: Networks of evolutionary processors: results and perspectives. In: Molecular Computational Models: Unconventional Approaches, pp. 78–114. Idea Group Publishing, Hershey (2005)

    Google Scholar 

  9. Rozenberg, G., Salomaa, A. (eds.): Handbook of Formal Languages. Springer, Berlin (1997)

    MATH  Google Scholar 

  10. Sankoff, D., et al.: Gene order comparisons for phylogenetic inference: evolution of the mitochondrial genome. In: Proc. Natl. Acad. Sci. USA, vol. 89, pp. 6575–6579 (1992)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2009 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Bottoni, P., Labella, A., Manea, F., Mitrana, V., Sempere, J.M. (2009). Filter Position in Networks of Evolutionary Processors Does Not Matter: A Direct Proof. In: Deaton, R., Suyama, A. (eds) DNA Computing and Molecular Programming. DNA 2009. Lecture Notes in Computer Science, vol 5877. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-10604-0_1

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-10604-0_1

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-10603-3

  • Online ISBN: 978-3-642-10604-0

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics