2020
DOI: 10.1007/s41965-020-00031-5
|View full text |Cite
|
Sign up to set email alerts
|

A Turing machine simulation by P systems without charges

Abstract: It is well known that the kind of P systems involved in the definition of the P conjecture is able to solve problems in the complexity class P by leveraging the uniformity condition. Here we show that these systems are indeed able to simulate deterministic Turing machines working in polynomial time with a weaker uniformity condition and using only one level of membrane nesting. This allows us to embed this construction into more complex membrane structures, possibly showing that constructions similar to the on… Show more

Help me understand this report
View preprint versions

Search citation statements

Order By: Relevance

Paper Sections

Select...
4

Citation Types

0
4
0

Year Published

2020
2020
2022
2022

Publication Types

Select...
7

Relationship

3
4

Authors

Journals

citations
Cited by 15 publications
(4 citation statements)
references
References 17 publications
0
4
0
Order By: Relevance
“…Membrane computing (MC) (Pan et al, 2019;Leporati et al, 2020;Zhang, 2021), a new branch of natural computing, has developed into an important research direction in the past decades. MC (the models are called P systems), initiated by Prof. Pǎun (Paun, 2000), abstracts computing models inspired from the structure and the functioning of the biological cells, organs and colonies of bacteria.…”
Section: Introductionmentioning
confidence: 99%
“…Membrane computing (MC) (Pan et al, 2019;Leporati et al, 2020;Zhang, 2021), a new branch of natural computing, has developed into an important research direction in the past decades. MC (the models are called P systems), initiated by Prof. Pǎun (Paun, 2000), abstracts computing models inspired from the structure and the functioning of the biological cells, organs and colonies of bacteria.…”
Section: Introductionmentioning
confidence: 99%
“…In [8,11], solutions for the SAT problem are proposed which use different strategies than previously proposed solutions. Systems of a shallow depth are the subject of [20][21][22]. A recent survey on different strategies to approach computationally hard problems by P systems with active membranes can be found in [39].…”
Section: Introductionmentioning
confidence: 99%
“…In [7,10] solutions for SAT are proposed which use different strategies than previously proposed solutions. Systems of a shallow depth are the subject of [17][18][19]. A recent survey on different strategies to approach computationally hard problems by P systems with active membranes can be found in [36].…”
Section: Introductionmentioning
confidence: 99%