P Systems with Proteins on Active Membranes

Abstract

P systems with active membranes, as a sort of basic P system, include in communication rules and out communication rules, where communication rules are controlled by polarizations. However, the communication of objects among living cells may be controlled by several factors, such as proteins, polarizations, etc. Based on this biological fact, in this article, a new class of P systems, named P systems with proteins on active membranes (known as PAM P systems) is considered, where the movement of objects is controlled by both proteins and polarizations. The computational theory of PAM P systems is discussed. More specifically, we show that PAM P systems achieve Turing universality when the systems use two membranes, one protein and one polarization. Moreover, the PAM P systems, with the help of membrane division rules, make the SAT problem solvable. These results indicate that PAM P systems are also a sort of powerful system.

Keywords

• <tt>SAT</tt> problem
• Turing universality
• P systems
• active membranes
• membrane computing