Complexity-preserving simulations among three variants of accepting networks of evolutionary processors

In this paper we consider three variants of accepting networks of evolutionary processors. It is known that two of them 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. We also discuss the possibility of constructing simulations that preserve not only complexity, but also the shape of the simulated network.

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

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

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

[4]  Victor Mitrana,et al.  Networks of Evolutionary Picture Processors with Filtered Connections , 2009, UC.

[5]  Victor Mitrana,et al.  Networks of Evolutionary Processors: Results and Perspectives , 2005 .

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

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

[8]  Gheorghe Paun,et al.  Computing with Membranes , 2000, J. Comput. Syst. Sci..

[9]  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.

[10]  Bianca Truthe,et al.  On the Power of Networks of Evolutionary Processors , 2007, MCU.

[11]  Victor Mitrana,et al.  Solving NP-Complete Problems With Networks of Evolutionary Processors , 2001, IWANN.

[12]  Florin Manea,et al.  On the Descriptional Complexity of Accepting Networks of Evolutionary Processors with Filtered Connections , 2008, Int. J. Found. Comput. Sci..

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

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

[15]  Artiom Alhazov,et al.  On the size of computationally complete hybrid networks of evolutionary processors , 2009, Theor. Comput. Sci..

[16]  Artiom Alhazov,et al.  Obligatory Hybrid Networks of Evolutionary Processors , 2009, ICAART.

[17]  Luciano De Errico,et al.  Towards a new architecture for symbolic processing , 1995 .

[18]  Grzegorz Rozenberg,et al.  Handbook of Formal Languages , 1997, Springer Berlin Heidelberg.

[19]  Geoffrey E. Hinton,et al.  Massively Parallel Architectures for AI: NETL, Thistle, and Boltzmann Machines , 1983, AAAI.