Abstract
Networks of splicing processors (NSP for short) embody a subcategory among the new computational models inspired by natural phenomena with theoretical potential to handle unsolvable problems efficiently. Current literature considers three variants in the context of networks managed by random-context filters. Despite the divergences on system complexity and control degree over the filters, the three variants were proved to hold the same computational power through the simulations of two computationally complete systems: Turing machines and 2-tag systems. However, the conversion between the three models by means of a Turing machine is unattainable because of the huge computational costs incurred. This research paper addresses this issue with the proposal of direct and efficient simulations between the aforementioned paradigms. The information about the nodes and edges (i.e., splicing rules, random-context filters, and connections between nodes) composing any network of splicing processors belonging to one of the three categories is used to design equivalent networks working under the other two models. We demonstrate that these new networks are able to replicate any computational step performed by the original network in a constant number of computational steps and, consequently, we prove that any outcome achieved by the original architecture can be accomplished by the constructed architectures without worsening the time complexity.
Funder
Unitatea Executiva pentru Finantarea Invatamantului Superior, a Cercetarii, Dezvoltarii si Inovarii
Comunidad de Madrid
Subject
General Mathematics,Engineering (miscellaneous),Computer Science (miscellaneous)
Reference27 articles.
1. A new class of symbolic abstract neural nets: Tissue P systems;Martín-Vide;Lect. Notes Comput. Sci.,2002
2. Membrane Computing. An Introduction;Păun,2002
3. Evolutionary systems: a language generating device inspired by evolving communities of cells
4. Networks of parallel language processors;Csuhaj-Varjú;Lect. Notes Comput. Sci. (LNCS),1997
5. Flow-Based Programming: A New Approach to Application Development;Morrison,2010