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

Benenson自动机的计算能力

The Computational Power of Benenson Automata

David Soloveichik, Erik Winfree

摘要:

自主分子计算机的发展能够在体内对局部药物管理做出独立决定,这可能会给医学带来革命性的变化。最近,Benenson等人(2004)设想了一种形式的“智能药物”,其可以通过实施体外方案来实现,其中长DNA状态分子以依赖于特定短DNA "规则分子“的存在的方式被限制酶重复切割。为了分析他们的方案在计算能力方面的潜力,我们研究了一个抽象概念,假设某种限制性内切酶是可用的,并且反应发生没有错误。我们还讨论了我们的分子算法如何与已知的限制性内切酶。通过展示一种模拟任意电路的方法,我们证明了这些“Benenson自动机”能够计算任意布尔函数。此外,我们表明,他们能够有效地计算正是这些功能可计算的日志深度电路。在计算上,我们正式提出了一个新的变种有限宽度分支程序的分子实现。

英文摘要:

The development of autonomous molecular computers capable of making independent decisions in vivo regarding local drug administration may revolutionize medical science. Recently Benenson at el (2004) have envisioned one form such a ``smart drug'' may take by implementing an in vitro scheme, in which a long DNA state molecule is cut repeatedly by a restriction enzyme in a manner dependent upon the presence of particular short DNA ``rule molecules.'' To analyze the potential of their scheme in terms of the kinds of computations it can perform, we study an abstraction assuming that a certain class of restriction enzymes is available and reactions occur without error. We also discuss how our molecular algorithms could perform with known restriction enzymes. By exhibiting a way to simulate arbitrary circuits, we show that these ``Benenson automata'' are capable of computing arbitrary Boolean functions. Further, we show that they are able to compute efficiently exactly those functions computable by log-depth circuits. Computationally, we formalize a new variant of limited width branching programs with a molecular implementation.

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

↑