Research Group on Natural Computing

Several solutions to hard numerical problems using P systems have been presented recently, and strong similarities in their designs have been noticed. In this paper we present a new solution, to the Partition problem, via a family of deterministic P systems with active membranes using 2-division. Then, we intend to show that the idea of a cellular programming language is possible (at least for some relevant family of NP-complete problems), indicating some “subroutines” that can be used in a variety of situations and therefore could be useful for designing solutions for new problems in the future.