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

Authors:
Paolo Bottoni;Anna Labella;Florin Manea;Victor Mitrana;Jose M. Sempere
Affiliations:
Department of Computer Science, "Sapienza" University of Rome, Rome, Italy 00198;Department of Computer Science, "Sapienza" University of Rome, Rome, Italy 00198;Faculty of Mathematics, University of Bucharest, Bucharest, Romania 70109;Faculty of Mathematics, University of Bucharest, Bucharest, Romania 70109 and Department of Information Systems and Computation, Technical University of Valencia, Valencia, Spain 46022;Department of Information Systems and Computation, Technical University of Valencia, Valencia, Spain 46022
Venue:
DNA Computing and Molecular Programming
Year:
2009

Citing 0
Cited 3

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

Natural Computing: an international journal
Deciding networks of evolutionary processors

DLT'11 Proceedings of the 15th international conference on Developments in language theory
Complexity results for deciding Networks of Evolutionary Processors

Theoretical Computer Science

Quantified Score

Hi-index	0.00

Visualization

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.