arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1902.03883cs.CC
收藏

无电荷P系统模拟图灵机

A Turing machine simulation by P systems without charges

Alberto Leporati, Luca Manzoni, Giancarlo Mauri, Antonio E. Porreca, Claudio Zandron

摘要:

众所周知,P猜想的定义中所涉及的P系统能够通过利用一致性条件来解决复杂性类$\mathbf{P}$中的问题。在这里,我们表明,这些系统确实能够模拟确定性的图灵机工作在多项式时间与较弱的均匀性条件和使用只有一个层次的膜嵌套。这使我们能够将这种结构嵌入到更复杂的膜结构中,可能表明在这种情况下也可以进行类似于[1]中对带电荷的P系统进行的结构。

英文摘要:

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 $\mathbf{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 one performed in [1] for P systems with charges can be carried out also in this case.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑