Depth-two P systems can simulate Turing machines with NP oracles
•We consider the computing power of a model of polarizationless P systems with active membranes.•This model uses evolution, communication, dissolution, and (weak) membrane division rules.•We prove that these P systems compute at least all problems in the complexity class ▪.•We do so by simulating no...
Saved in:
| Published in: | Theoretical computer science Vol. 908; pp. 43 - 55 |
|---|---|
| Main Authors: | , , , |
| Format: | Journal Article |
| Language: | English |
| Published: |
Elsevier B.V
24.03.2022
|
| Subjects: | |
| ISSN: | 0304-3975, 1879-2294 |
| Online Access: | Get full text |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Be the first to leave a comment!