Published February 2, 2016
| Version v1
Publication
Turing Incompleteness of Asynchronous P Systems with Active Membranes
Description
We prove that asynchronous P systems with active membranes without divi-
sion rules can be simulated by place/transition Petri nets, and hence are computationally
weaker than Turing machines. This result holds even if the synchronisation mechanisms
provided by electrical charges and membrane dissolution are exploited.
Additional details
Identifiers
- URL
- https://idus.us.es/handle/11441/33791
- URN
- urn:oai:idus.us.es:11441/33791