Accepting Networks of Evolutionary Processors with Filtered Connections

Cezara Drăgoi (University of Bucharest, Romania)

Florin Manea (University of Bucharest, Romania)

Victor Mitrana (University of Bucharest, Romania)

Abstract: In this paper we simplify a recent model of computation considered in [Margenstern et al. 2005], namely accepting network of evolutionary processors, by moving the filters from the nodes to the edges. Each edge is viewed as a two-way channel such that input and output filters, respectively, of the two nodes connected by the edge coincide. Thus, the possibility of controlling the computation in such networks seems to be diminished. In spite of this observation these simplified networks have the same computational power as accepting networks of evolutionary processors, that is they are computationally complete. As a consequence, we propose characterizations of two complexity classes, namely NP and PSPACE, in terms of accepting networks of evolutionary processors with filtered connections.

Keywords: Turing machine, complexity class, evolutionary processor, network of evolutionary processors

Categories: F.1.1, F.1.3, F.4.3