文章基本信息

标题：Accepting Networks of Evolutionary Processors with Filtered Connections
本地全文：下载
作者：C. Drăgoi ; F. Manea ; V. Mitrana 等
期刊名称：Journal of Universal Computer Science
印刷版ISSN：0948-6968
出版年度：2007
卷号：13
期号：11
页码：1598-1598
出版社：Graz University of Technology and Know-Center
摘要：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.
关键词：Turing machine, complexity class, evolutionary processor, network of evolutionary processors