Simulating polarization by random context filters in networks of evolutionary processors

Networks of evolutionary processors (NEP for short) form a class of models within the new computational paradigms inspired by biological phenomena. They are known to be theoretically capable of solving intractable problems. So far, there are two main categories that differ from each other by the nature of filtering process controlling the communication step: random-context clauses or polarization. Several studies have proven that both of them are computationally complete through efficient simulations of universal computational models such as Turing machines and 2-tag systems. Nevertheless, the indirect conversion between the two network variants results in an exponential increase of the computational complexity. In this paper, we suggest a direct simulation of polarized NEP through NEP with random-context filters which incurs in lower complexity costs.

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

[2]  Victor Mitrana,et al.  Networks of Polarized Evolutionary Processors Are Computationally Complete , 2014, LATA.

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

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

[5]  Florin Manea,et al.  Accepting Networks of Evolutionary Processors with Subregular Filters , 2013, Theory of Computing Systems.

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

[7]  Victor Mitrana,et al.  On the computational power of networks of polarized evolutionary processors , 2017, Inf. Comput..

[8]  Victor Mitrana,et al.  Filters defined by random contexts versus polarization in networks of evolutionary processors , 2020, Theor. Comput. Sci..

[9]  George Cybenko,et al.  Mobile agents: the next generation in distributed computing , 1997, Proceedings of IEEE International Symposium on Parallel Algorithms Architecture Synthesis.

[10]  Gheorghe Paun,et al.  Language Theory and Molecular Genetics: Generative Mechanisms Suggested by DNA Recombination , 1997, Handbook of Formal Languages.

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

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

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

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

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

[16]  Victor Mitrana,et al.  Accepting Networks of Splicing Processors , 2005, CiE.

[17]  Victor Mitrana,et al.  Filter Position in Networks of Evolutionary Processors Does Not Matter: A Direct Proof , 2009, DNA.

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

[19]  Victor Mitrana,et al.  Evolutionary systems: a language generating device inspired by evolving communities of cells , 2000, Acta Informatica.

[20]  Victor Mitrana,et al.  All NP-Problems Can Be Solved in Polynomial Time by Accepting Networks of Splicing Processors of Constant Size , 2006, DNA.

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

[22]  Victor Mitrana,et al.  On Accepting Networks of Evolutionary Processors with at Most Two Types of Nodes , 2009, LATA.

[23]  Victor Mitrana,et al.  All NP-problems can be solved in polynomial time by accepting hybrid networks of evolutionary processors of constant size , 2007, Inf. Process. Lett..

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

[25]  Erzsébet Csuhaj-Varjú,et al.  Networks of Parallel Language Processors , 1997, New Trends in Formal Languages.

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

[27]  J. Paul Morrison,et al.  Flow-Based Programming, 2nd Edition: A New Approach to Application Development , 2010 .

[28]  Victor Mitrana,et al.  Networks of polarized evolutionary processors , 2014, Inf. Sci..