Time‐Free Solution to SAT Problem by Tissue P Systems

Luo, Yuling; Xiong, Zenggang; Zhang, Guanghua

doi:10.1155/2017/1567378

Cited by 5 publications

(2 citation statements)

References 24 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…As far as time-free is concerned, the approach was proposed in [34]. Recently, relative to NPcomplete problems, some results have been obtained with time-freeness [35], [36].…”

Section: Introductionmentioning

confidence: 99%

Flip-flop P systems with proteins on membranes in a time-free manner

2023

Self Cite

View full text Add to dashboard Cite

Flip-flop P systems with proteins are a bio-inspired variant of cell-like P systems in membrane computing, where proteins can control the execution of rules. In this work, firstly, in order to simulate the fact that the execution time of biochemical reactions is uncertain, considering time-freeness, we therefore construct a novel variant, namely timed flip-flop P systems with proteins, where the protein on each membrane only has two types of working states, and such a system runs under the time-freeness mode; secondly, we study the computation power of this variant, and it is shown that a system with only one membrane and a maximum rule length of 4 is Turing universal; moreover, based on the variant, a solution to the SAT problem is obtained by the constructed system in polynomial time. Our work indicates that the constructed variant with time-freeness can still solve the SAT problem in feasible time. Because timefreeness of rules is employed, the variant may be more suitable for particular applications. INDEX TERMS P system, protein, university, SAT , time-freeness.

show abstract

“…As far as time-free is concerned, the approach was proposed in [34]. Recently, relative to NPcomplete problems, some results have been obtained with time-freeness [35], [36].…”

Section: Introductionmentioning

confidence: 99%

Flip-flop P systems with proteins on membranes in a time-free manner

2023

Self Cite

View full text Add to dashboard Cite

show abstract

“…[38], the semi-uniform solution of the SAT has obtained for the first time. Recently, some NP-hard problems have been solved by various P systems in the time-free mode [39][40][41]. It should be noted that if tissue-like P systems work in a timefree manner, we call them timed tissue-like P systems.…”

Section: Introductionmentioning

confidence: 99%

Timed Homeostasis Tissue-Like P Systems With Evolutional Symport/Antiport Rules

et al. 2020

Self Cite

View full text Add to dashboard Cite

Tissue-like P systems are a type of distributed parallel computing models inspired by actual biological tissue. In this paper, we consider a new variant of tissue-like P systems, which is called tissuelike P systems with evolutional symport/antiport rules. Unlike traditional models of this type, in the new P systems, objects can change during transmission. In biology, an organism that is in "homeostasis" reduces its dependence on external conditions, thereby keeping it relatively constant and maintaining a relatively stable internal environment. In our work, we remove the assumption that the quantity of objects in the environment is infinite, reducing the influence of the environment on this system, so the environment no longer provides powerful energy for cells. Moreover, the time-free mode is introduced into this type of P systems, which makes the constructed systems more robust. We investigate the computational power and computational efficiency of the constructed system. Specifically, by simulating register machines, such a P system can generate any Turing computable set of numbers. In addition, we prove that this constructed system can efficiently solve the SAT problem. Although we restrict P systems and consider time-free manner, the results show that this system is not only Turing universal, but also can solve NP-complete problem.

show abstract