On the computational power of networks of polarized evolutionary processors

Abstract We consider a new variant of networks of evolutionary processors which seems more suitable for a software and hardware implementation. Each processor as well as the data navigating throughout the network are now considered to be polarized. While the polarization of every processor is predefined, the data polarization is dynamically computed. Consequently, the protocol of communication is naturally defined by this polarization. We show that tag systems can be simulated by these networks with a constant number of nodes, while Turing machines can be efficiently simulated by these networks with a number of nodes depending linearly on the tape alphabet of the Turing machine. We also propose a simulation of Turing machines by networks with a constant number of nodes, which is reflected in an increase of the computation time. Finally, we show that every network can be simulated by a Turing machine and discuss the time complexity of this simulation.

[1]  Victor Mitrana,et al.  Hybrid Networks of Evolutionary Processors , 2003, GECCO.

[2]  José Miguel Rojas,et al.  Parallel Simulation of NEPs on Clusters , 2011, 2011 IEEE/WIC/ACM International Conferences on Web Intelligence and Intelligent Agent Technology.

[3]  Victor Mitrana,et al.  Networks of Polarized Evolutionary Processors as Problem Solvers , 2012, KES.

[4]  Luis Fernando de Mingo López,et al.  NETWORKS OF EVOLUTIONARY PROCESSORS: JAVA IMPLEMENTATION OF A THREADED PROCESSOR 1 , 2007 .

[5]  J. Hartmanis,et al.  On the Computational Complexity of Algorithms , 1965 .

[6]  Ion Petre,et al.  Complexity-preserving simulations among three variants of accepting networks of evolutionary processors , 2011, Natural Computing.

[7]  W. Daniel Hillis,et al.  The connection machine , 1985 .

[8]  Emil L. Post.  Formal Reductions of the General Combinatorial Decision Problem , 1943 .

[9]  Miguel Angel Díaz,et al.  Implementation of Massive Parallel Networks of Evolutionary Processors (MPNEP): 3-Colorability Problem , 2007, NICSO.

[10]  Victor Mitrana,et al.  Small universal accepting hybrid networks of evolutionary processors , 2010, Acta Informatica.

[11]  D. Sankoff,et al.  Gene order comparisons for phylogenetic inference: evolution of the mitochondrial genome. , 1992, Proceedings of the National Academy of Sciences of the United States of America.

[12]  Yurii Rogozhin,et al.  Small Universal Turing Machines , 1996, Theor. Comput. Sci..

[13]  Victor Mitrana,et al.  Networks of evolutionary processors , 2003, Acta Informatica.

[14]  Victor Mitrana,et al.  Accepting Networks of Evolutionary Word and Picture Processors: A Survey , 2010, Scientific Applications of Language Methods.

[15]  Victor Mitrana,et al.  Accepting Networks of Evolutionary Processors with Filtered Connections , 2007, J. Univers. Comput. Sci..

[16]  Gheorghe Paun,et al.  Membrane Computing , 2002, Natural Computing Series.

[17]  Victor Mitrana,et al.  On the size complexity of universal accepting hybrid networks of evolutionary processors , 2007, Mathematical Structures in Computer Science.

[18]  Alfonso Rodríguez-Patón,et al.  A New Class of Symbolic Abstract Neural Nets: Tissue P Systems , 2002, COCOON.

[19]  Victor Mitrana,et al.  Accepting Hybrid Networks of Evolutionary Processors , 2004, DNA.

[20]  Victor Mitrana,et al.  A New Characterization of NP, P, and PSPACE with Accepting Hybrid Networks of Evolutionary Processors , 2010, Theory of Computing Systems.