In this work, we propose a P system which carries out computing by carving.
Computing by carving was proposed by Gh. P˘aun as a technique to generate formal
languages which can even be non recursively enumerable. Hence, it can be considered
a hypercomputational technique. Here, we propose a first scheme based on P systems
in order to perform computing by carving any formal language. So, the paper shows
indirectly that these systems, under certain assumptions, can be considered a model for
hypercomputation
