【24h】

Some Computational Issues in Membrane Computing

机译:膜计算中的一些计算问题

获取原文

摘要

Membrane computing is a branch of molecular computing that aims to develop models and paradigms that are biologically motivated. It identifies an unconventional computing model, namely a P system, from natural phenomena of cell evolutions and chemical reactions. Because of the nature of maximal parallelism inherent in the model, P systems have a great potential for implementing massively concurrent systems in an efficient way that would allow us to solve currently intractable problems (in much the same way as the promise of quantum and DNA computing) once future bio-technology (or silicon-technology) gives way to a practical bio-realization (or chip realization). Here we report on recent results that answer some interesting and fundamental open questions in the field. These concern computational issues such as determinism versus nondeterminism, membrane and alphabet-size hierarchies, and various notions of parallelism.
机译:膜计算是分子计算的分支,旨在开发在生物学上动机的模型和范例。它识别非传统的计算模型,即P系统,来自细胞演化和化学反应的自然现象。由于模型中固有的最大并行性的性质,P系统以一种有效的方式实现大规模并发系统的潜力,这将使我们能够解决当前难以解决的问题(与量子和DNA计算的承诺。 )一旦将来的生物技术(或硅技术)就会让位于实际的生物实现(或芯片实现)。在这里,我们报告了最近的结果,在该领域回答了一些有趣和基本的开放问题。这些涉及确定主义与非eterminism,膜和字母大小的层次结构等的计算问题,以及并行性的各种概念。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号