2014 | OriginalPaper | Buchkapitel
Computational Efficiency and Universality of Timed P Systems with Membrane Creation
verfasst von : Bosheng Song, Mario J. Pérez-Jiménez, Linqiang Pan
Erschienen in: Bio-Inspired Computing - Theories and Applications
Verlag: Springer Berlin Heidelberg
Aktivieren Sie unsere intelligente Suche, um passende Fachinhalte oder Patente zu finden.
Wählen Sie Textabschnitte aus um mit Künstlicher Intelligenz passenden Patente zu finden. powered by
Markieren Sie Textabschnitte, um KI-gestützt weitere passende Inhalte zu finden. powered by
In this work, inspired from this biological motivation that in living cells, the execution time of different biological processes is difficult to know precisely and very sensitive to environmental factors that might be hard to control, the computational efficiency and universality of timed P systems with membrane creation are investigated. Specifically, we give a time-free solution to
SAT
problem by a family of P systems with membrane creation in the sense that the correctness of the solution is irrelevant to the times associated with the involved rules. We further show that time-free P systems with membrane creation are computationally universal.