Abstract
A new class of distributed computing models inspired from biology, that of P Systems, was recently introduced by Gh. Pǎun. Several variants of P Systems were already shown to be computationally universal, equal in power to Turing Machines. We investigate in this paper the power of computability of P Systems based on rewriting, with cooperation, priorities and external output. It is established that rewriting P Systems with priorities and two membranes is computationally universal, thereby making an improvement in the existing result that RE⊆RP 3(Pri). We give a new model in P Systems stressing the importance of parallelism. The power of computability of such models is investigated by comparing them with classic mechanisms in L-Systems: TOL, EOL and ETOL Systems
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
