Accepting Networks of Splicing Processors with Filtered Connections
In this paper we simplify accepting networks of splicing processors considered in  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 coincide. Thus, the possibility of controlling the computation in such networks seems to be diminished. In spite of this and of the fact that splicing alone is not a very powerful operation these networks are still computationally complete. As a consequence, we propose characterizations of two complexity classes, namely NP and PSPACE, in terms of accepting networks of restricted splicing processors with filtered connections.
KeywordsTuring Machine Mathematical Linguistics Communication Step Input Word Tape Head
Unable to display preview. Download preview PDF.
- 3.Errico, L., Jesshope, C.: Towards a new architecture for symbolic processing. In: Artificial Intelligence and Information-Control Systems of Robots 1994, pp. 31–40. World Scientific, Singapore (1994)Google Scholar
- 4.Fahlman, S., Hinton, G., Seijnowski, T.: Massively parallel architectures for AI: NETL, THISTLE and Boltzmann Machines. In: Proc. AAAI National Conf. on AI, pp. 109–113. William Kaufman, Los Altos (1983)Google Scholar
- 6.Hillis, W.: The Connection Machine. MIT Press, Cambridge (1985)Google Scholar
- 7.Loos, R.: On accepting networks of splicing processors of size 3. In: Proc. CiE 2007 (in press, 2007)Google Scholar
- 10.Martín-Vide, C., Mitrana, V.: Networks of evolutionary processors: results and perspectives. In: Molecular Computational Models: Unconventional Approaches, pp. 78–114. Idea Group Publishing, Hershey (2005)Google Scholar
- 12.Păun, G.: Distributed architectures in DNA computing based on splicing: limiting the size of components. In: Unconventional Models of Computation, pp. 323–335. Springer, Heidelberg (1998)Google Scholar