@article{BordihnMitranaNegruetal.2018,
  author    = {Bordihn, Henning and Mitrana, Victor and Negru, Maria C. and Paun, Andrei and Paun, Mihaela},
  title     = {Small networks of polarized splicing processors are universal},
  series = {Natural computing : an innovative journal bridging biosciences and computer sciences ; an international journal},
  volume    = {17},
  journal   = {Natural computing : an innovative journal bridging biosciences and computer sciences ; an international journal},
  number    = {4},
  publisher = {Springer},
  address   = {Dordrecht},
  issn      = {1567-7818},
  doi       = {10.1007/s11047-018-9691-0},
  pages     = {799 -- 809},
  year      = {2018},
  abstract  = {In this paper, we consider the computational power of a new variant of networks of splicing processors in which each processor as well as the data navigating throughout the network are now considered to be polarized. While the polarization of every processor is predefined (negative, neutral, positive), the polarization of data is dynamically computed by means of a valuation mapping. Consequently, the protocol of communication is naturally defined by means of this polarization. We show that networks of polarized splicing processors (NPSP) of size 2 are computationally complete, which immediately settles the question of designing computationally complete NPSPs of minimal size. With two more nodes we can simulate every nondeterministic Turing machine without increasing the time complexity. Particularly, we prove that NPSP of size 4 can accept all languages in NP in polynomial time. Furthermore, another computational model that is universal, namely the 2-tag system, can be simulated by NPSP of size 3 preserving the time complexity. All these results can be obtained with NPSPs with valuations in the set as well. We finally show that Turing machines can simulate a variant of NPSPs and discuss the time complexity of this simulation.},
  language  = {en}
}