Thats a unique idea.You should consider the following idea to enhance your idea so that it would impact uniquely:   present a method for solving the NP-complete SAT problem using the type of P systems that is defined in [9]. The SAT problem is solved in O(nm) time, where n is the number of boolean variables and m is the number of clauses for a instance written in conjunctive normal form. Thus  can say that the solution for each given instance is obtained in linear time.  succeeded in solving SAT by a uniform construction of a deterministic P system which uses rules involving objects in regions, proteins on membranes, and membrane division.  also investigate the computational por of the systems with proteins on membranes and show that the universality can be reached even in the case of systems that do not even use the membrane division and have only one membrane.
['Andrei Paun', 'Bianca Popa']
I am writing a research paper on a idea P systems with proteins on membranes and membrane division
[{"from": "human", "value": "I am writing a research paper on a idea P systems with proteins on membranes and membrane division"}, {"from": "gpt", "value": "Thats a unique idea.You should consider the following idea to enhance your idea so that it would impact uniquely:   present a method for solving the NP-complete SAT problem using the type of P systems that is defined in [9]. The SAT problem is solved in O(nm) time, where n is the number of boolean variables and m is the number of clauses for a instance written in conjunctive normal form. Thus  can say that the solution for each given instance is obtained in linear time.  succeeded in solving SAT by a uniform construction of a deterministic P system which uses rules involving objects in regions, proteins on membranes, and membrane division.  also investigate the computational por of the systems with proteins on membranes and show that the universality can be reached even in the case of systems that do not even use the membrane division and have only one membrane."}]