Time-free solution to SAT problem using P systems with active membranes

P systems are a class of distributed and parallel computation models inspired by the structure and the functioning of living cells. P systems have been used to solve computation hard problems, where the execution of each rule is completed in unit time (a global clock is assumed for timing and synchr...

Celý popis

Uloženo v:
Podrobná bibliografie
Vydáno v:Theoretical computer science Ročník 529; s. 61 - 68
Hlavní autoři: Song, Tao, Macías-Ramos, Luis F., Pan, Linqiang, Pérez-Jiménez, Mario J.
Médium: Journal Article
Jazyk:angličtina
Vydáno: Elsevier B.V 10.04.2014
Témata:
Membrane computing
NP-complete problem
P system
Semi-uniform solution
Time-free solution
Membrane computing
NP-complete problem
P system
Time-free solution
Semi-uniform solution
ISSN:0304-3975, 1879-2294
On-line přístup:Získat plný text
Tagy: Přidat tag
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
Popis
Shrnutí:P systems are a class of distributed and parallel computation models inspired by the structure and the functioning of living cells. P systems have been used to solve computation hard problems, where the execution of each rule is completed in unit time (a global clock is assumed for timing and synchronizing the execution of rules). The assumption that the execution of each rule takes exactly one time unit plays an vital role to make a system working synchronously, and it has also been used to characterize the computational efficiency and time complexity of a system. In this work, we investigate the computation power of P systems without such time assumption. Specifically, we give a time-free solution to SAT problem using P systems with active membranes in the sense that the correctness of the solution does not depend on the precise timing of the involved rules.
ISSN:0304-3975
1879-2294
DOI:10.1016/j.tcs.2013.11.014