ACCEPTING NETWORKS OF EVOLUTIONARY PROCESSORS: COMPLEXITY ASPECTS - Recent Results and New Challenges

Florin Manea, Victor Mitrana

Abstract

In this paper we survey some results reported so far, for the new computational model of Accepting Networks of Evolutionary Processors (ANEPs), in the area of computational and descriptional complexity. First we give the definitions of the computational model, and its variants, then we define several ANEP complexity classes, and, further, we show how some classical complexity classes, defined for Turing Machines, can be characterized in this framework. After this, we briefly show how ANEPs can be used to solve efficiently NP-complete problems. Finally, we discuss a list of open problems and further directions of research which appear interesting to us.

References

  1. Castellanos, J., Martín-Vide, C., Mitrana, V., Sempere, J. (2001) Solving NP-complete Problems with Networks of Evolutionary Processors, In International WorkConference on Artificial and Natural Neural Networks (IWANN 2001), LNCS 2084, 621-628. Springer.
  2. Csuhaj-Varjú, E. and Salomaa, A. (1997) Networks of Parallel Language Processors. In New Trends in Formal Languages, LNCS 1218, 299 - 318. Springer.
  3. Csuhaj-Varjú, E., Mitrana, V. (2000). Evolutionary Systems: A Language Generating Device Inspired by Evolving Communities of Cells. Acta Informatica, 36, 913 - 926. Springer.
  4. Dassow, J. and Mitrana, V. (2008). Accepting Networks of Non-Inserting Evolutionary Processors, In Proceedings of NCGT 2008: Workshop on Natural Computing and Graph Transformations, 29-42.
  5. Dassow, J., Martin-Vide, C., Mitrana, V. (2006). Free Generating Hybrid Networks of Evolutionary Processors, In Formal Models, Languages and Applications Series in Machine Perception and Artificial Intelligence 66, 65-78. World Scientific.
  6. Dra?goi, C. and Manea, F. (2008). On the Descriptional Complexity of Accepting Networks of Evolutionary Processors with Filtered Connections. International Journal of Foundations of Computer Science, 19:5, 1113 - 1132. World Scientific.
  7. Dra?goi, C., Manea, F., Mitrana, V. (2007). Accepting Networks of Evolutionary Processors With Filtered Connections. Journal of Universal Computer Science, 13:11, 1598 - 1614. Springer.
  8. Errico, L., and Jesshope, C. (1994). Towards a New Architecture for Symbolic Processing, In Artificial Intelligence and Information-Control Systems of Robots 7894, 31-40. World Scientific.
  9. Fahlman, S. E., Hinton, G.E., Seijnowski, T.J. (1983) Massively Parallel Architectures for AI: NETL, THISTLE and Boltzmann Machines, In Proc. of the National Conference on Artificial Intelligence, 109-113. AAAI Press.
  10. Garey, M., and Johnson, D. (1979). Computers and Intractability: A Guide to the Theory of NPcompleteness, San Francisco, CA: W. H. Freeman.
  11. Gómez Blas, N. (2008) Redes de Procesadores Evolutivos: Autoaprendizaje de Filtros en las Conexiones, PhD Thesis, Politechnical University of Madrid. (in Spanish).
  12. Hillis, W.D. (1979). The Connection Machine. MIT Press, Cambridge.
  13. Loos, R., Manea, F., Mitrana, V. (2008) On Small, Reduced, and Fast Universal Accepting Networks of Splicing Processors, in press Theoretical Computer Science, doi:10.1016/j.tcs.2008.09.048. Elsevier.
  14. Manea, F. (2005). Timed Accepting Hybrid Networks of Evolutionary Processors, In Artificial Intelligence and Knowledge Engineering Applications: A Bioinspired Approach, LNCS 3562, 122 - 132. Springer.
  15. Manea, F., Martin-Vide, C., Mitrana, V. (2005). Solving 3CNF-SAT and HPP in Linear Time Using WWW, In Machines, Computations and Universality, LNCS 3354, 269 - 280. Springer.
  16. Manea, F., Martin-Vide, C., Mitrana, V. (2007) Accepting Networks of Splicing Processors: Complexity Results, Theoretical Computer Science, 371:1-2, 72-82. Elsevier.
  17. Manea, F., Martin-Vide, C., Mitrana, V. (2007). On the Size Complexity of Universal Accepting Hybrid Networks of Evolutionary Processors, Mathematical Structures in Computer Science, 17:4, 753 - 771. Cambridge University Press.
  18. Manea, F., and Mitrana, V. (2007). All NP-problems Can Be Solved in Polynomial Time by Accepting Hybrid Networks of Evolutionary Processors of Constant Size, Information Processing Letters, 103:3, 112 - 118. Elsevier.
  19. Manea, F., Margenstern, M., Mitrana, V., Perez-Jimenez, M. J. (2008). A New Characterization of NP, P, and PSPACE With Accepting Hybrid Networks of Evolutionary Processors, in press Theory of Computing Systems, doi:10.1007/s00224-008-9124-z. Springer.
  20. Martín-Vide, C. and Mitrana, V. (2005) Networks of Evolutionary Processors: Results and Perspectives, In Molecular Computational Models: Unconventional Approaches, 78-114. Idea Group Publishing.
  21. Pa?un, G. and Saˆntean, L. (1989) Parallel Communicating Grammar Systems: The Regular Case, Annals of University of Bucharest, Ser. Matematica-Informatica 38, 55 - 63.
  22. Pa?un, G. (2000) Computing with Membranes, Journal of Computer and System Sciences 61, 108 - 143. ACM Press.
  23. D. Sankoff et al. (1992) Gene Order Comparisons for Phylogenetic Inference: Evolution of the Mitochondrial Genome, In Proceedings of the National Academy of Sciences of the United States of America 89, 6575- 6579.
Download


Paper Citation


in Harvard Style

Manea F. and Mitrana V. (2009). ACCEPTING NETWORKS OF EVOLUTIONARY PROCESSORS: COMPLEXITY ASPECTS - Recent Results and New Challenges . In Proceedings of the International Conference on Agents and Artificial Intelligence - Volume 1: Special Session NEPS, (ICAART 2009) ISBN 978-989-8111-66-1, pages 597-604. DOI: 10.5220/0001796305970604


in Bibtex Style

@conference{special session neps09,
author={Florin Manea and Victor Mitrana},
title={ACCEPTING NETWORKS OF EVOLUTIONARY PROCESSORS: COMPLEXITY ASPECTS - Recent Results and New Challenges},
booktitle={Proceedings of the International Conference on Agents and Artificial Intelligence - Volume 1: Special Session NEPS, (ICAART 2009)},
year={2009},
pages={597-604},
publisher={SciTePress},
organization={INSTICC},
doi={10.5220/0001796305970604},
isbn={978-989-8111-66-1},
}


in EndNote Style

TY - CONF
JO - Proceedings of the International Conference on Agents and Artificial Intelligence - Volume 1: Special Session NEPS, (ICAART 2009)
TI - ACCEPTING NETWORKS OF EVOLUTIONARY PROCESSORS: COMPLEXITY ASPECTS - Recent Results and New Challenges
SN - 978-989-8111-66-1
AU - Manea F.
AU - Mitrana V.
PY - 2009
SP - 597
EP - 604
DO - 10.5220/0001796305970604