Abstract
We investigated the computational power of a new variant of network of splicing processors, which simplifies the general model such that filters remain associated with nodes but the input and output filters of every node coincide. This variant, called network of uniform splicing processors, might be implemented more easily. Although the communication in the new variant seems less powerful, the new variant is sufficiently powerful to be computationally complete. Thus, nondeterministic Turing machines were simulated by networks of uniform splicing processors whose size depends linearly on the alphabet of the Turing machine. Furthermore, the simulation was time efficient. We argue that the network size can be decreased to a constant, namely six nodes. We further show that networks with only two nodes are able to simulate 2-tag systems. After these theoretical results, we discuss a possible software implementation of this model by proposing a conceptual architecture and describe all its components.
Subject
General Mathematics,Engineering (miscellaneous),Computer Science (miscellaneous)
Reference32 articles.
1. Handbook of Natural Computing;Rozenberg,2012
2. A new class of symbolic abstract neural nets: Tissue P systems;Martín-Vide;Lect. Notes Comput. Sci.,2002
3. Membrane Computing. An Introduction;Păun,2002
4. Evolutionary systems: a language generating device inspired by evolving communities of cells
5. Networks of parallel language processors;Csuhaj-Varjú;Lect. Notes Comput. Sci. (LNCS),1997
Cited by
1 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献