The computational properties of P systems with mutative membrane structures

Abstract

Membrane computing is a subfield of nature-inspired computing studying computational models named P systems, where several rules (division rules, dissolving rules, merging rules, creation rules, separation rules, etc) for evolving the membrane structure were considered in many variants of P systems, and most of these variants employ at most two of these types of rules. In this article, we combine budding rules, fusion rules, dissolving rules, division rules (both for non-elementary membrane and elementary membranes), therefore a mutative type of P systems, termed cell-like P systems with mutative membrane structures (CMMS P systems) are defined. We discuss the computational properties of CMMS P systems. More specifically, CMMS P systems are shown to be Turing universal by integrating some types of rules. Moreover, we prove that CMMS P systems can also effectively solve the SAT problem.