Abstract:
In this paper, we present a new universality result in P systems, by providing
a method to construct a P system ∏M with two cells that simulates an arbitrary
register machine M. The novelty of our approach is to utilize a very simple register
machine that supports reading of binary data. In our simple construction of system
∏M: (i) cell states of a "simulator" cell in ∏M model the instruction lines of M,
(ii) symbols (and their multiplicities) of ∏M model registers (and their values) of
M, (iii) evolution rules of M model the execution of instructions of M and (iv)
communication to/from a "data" cell of ∏M is used to model the reading of data
of M.