Abstract:
In this paper we offer an introduction to P Systems, a relatively new computational model inspired by biology. Our paper covers four of the more popular state-capable systems and provides a brief explanation of each, including at least one problem that each specific P System solves faster than a standard Turing machine (some NP-Complete problems are solved in polynomial P Steps). After
determining common elements across the systems we go on to describe discovery
algorithms: a high level approach to solving topology problems within P Systems.
Our description includes a mapping from our generic or high level system to the
low level rule sets for each of the P Systems covered in this paper. We also include
some documentation on the usage of our approach with an example and some
implications of the model itself.