Small Computationally Complete Symport/Antiport P Systems
نویسندگان
چکیده
It is known that P systems with symport/antiport rules simulate the register machines, i.e., they are computationally complete. Hence, due to the existence of universal register machines, there exist computationally complete subclasses of symport/antiport P systems with a number of rules limited by a constant. However, there was no estimation of this number in the literature. In this article, we first give a simple estimation of this constant, and then we show that the number can be reduced by grouping together several instructions of the simulated variant of the register machines. Finally, a universal P system with symport/antiport having only 44 rules is obtained.
منابع مشابه
Generating Languages by P Systems with Minimal Symport/Antiport
It is known that P systems with two membranes and minimal symport/antiport rules are “almost” computationally complete as generators of number or vector sets. Interpreting the result of the computation as the sequence of terminal symbols sent to the environment, we show that P systems with two membranes and symport rules of weight two or symport/antiport rules of weight one generate all recursi...
متن کاملTissue P Systems with Symport/Antiport Rules of One Symbol Are Computationally complete
We consider tissue P systems using symport/ antiport rules of only one symbol where in each link (channel) between two cells at most one rule is applied, but in each channel a symport/ antiport rule has to be used if possible. We prove that any recursively enumerable set of k-dimensional vectors of natural numbers can be generated (accepted) by such a tissue P system with symport/ antiport rule...
متن کاملP Systems with One Membrane and Symport/Antiport Rules of Five Symbols Are Computationally Complete
We consider P systems with only one membrane using symport/antiport rules and prove that any recursively enumerable set of k-dimensional vectors of natural numbers can be generated (accepted) by using at most k + 4 symbols; hence, any recur-sively enumerable set of natural numbers can be generated (accepted) by using at most five symbols.
متن کاملComputing Partial Recursive Functions by Deterministic Symport/Antiport P-Systems
In this paper, we prove that deterministic 1-membrane systems with symport/antiport rules are Turing-complete. Our proof is based on the notion of numerical partial recursive function computed by numerical programs of a language with simple instructions, defined by Martin Davis and Elaine Weyuker [10]. We reduced the task from partial recursive functions to numerical programs and then to sympor...
متن کاملTowards a Characterization of P Systems with Minimal Symport/Antiport and Two Membranes
We prove that any set of numbers containing zero generated by symport/antiport P systems with two membranes and minimal cooperation is finite (for both symport/antiport P systems and for purely symport P systems). On the other hand, one additional object in the output membrane allows symport/antiport P systems with two membranes and minimal cooperation generate any recursively enumerable sets o...
متن کامل