The computational power of timed P systems with active membranes using promoters

摘要: P systems with active membranes are a class of bioinspired computing models, where the rules used in non-deterministic maximally parallel manner. In this paper, first, new variant timed is proposed, application can be regulated by promoters only two polarizations. Next, we prove that any Turing computable set numbers generated such system time-free way. Moreover, construct uniform solution to problem framework recognizer polynomial time, and feasibility effectiveness proposed demonstrated an instance. Compared existing methods, constructed our work require fewer necessary resources RS-steps, which show effective NP-complete problem.