Accepting networks of splicing processors: Complexity results

In this paper we consider a new, bio-inspired computing model: the accepting network of splicing processors. We define two computational complexity classes based on this model and show how they are related to the classical ones defined for Turing machines, namely NP and PSPACE. Furthermore, we approach the topic of problem solving using these newly defined devices. In this context, a linear time solution for one of the most interesting NP-complete problems, the SAT problem, is presented. The results presented here suggest once more that nondeterminism might be approached in a deterministic way by means of multiplicities.