Abstract:
We present a new variant of how catalytic P systems can simulate register machines, thus reducing again the number of rules needed for simulating register machines. Moreover, we show that only 20 rules are needed to generate a non-semilinear set of natural numbers by a catalytic P system with two catalysts. Finally, we establish improved versions of universal catalytic P systems.
