arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 1508.00510cs.CGcs.CCcs.ET
收藏

证明Oritatami共转录折叠的图灵普适性(全文)

Proving the Turing Universality of Oritatami Co-Transcriptional Folding (Full Text)

Cody Geary, Pierre-Étienne Meunier, Nicolas Schabanel, Shinnosuke Seki

摘要:

我们研究了分子共转录折叠的oritatami模型。在oritatami系统中,转录物(“分子”)在合成(转录)时折叠,根据局部能量优化过程,这类似于实际生物分子(如RNA)在转录时折叠成复杂形状和功能。我们证明,有一个oritatami系统嵌入通用计算的折叠过程本身。我们的结果依赖于一个通用的工具箱,这是很容易重复使用的未来工作,设计复杂的功能oritatami系统的发展。我们开发了“低级”工具,可以轻松地将转录本中不同“功能”的编码分开,即使它们需要应用于折叠中的相同几何位置。我们建立在这些低层次的工具,一个编程框架,越来越多的抽象层次,从编码的指令到转录的逻辑分析。这个框架类似于标准算法理论中的硬件到算法的抽象层次。这些不同层次的抽象允许将我们系统的全局行为的正确性证明与其实现的正确性证明分开。由于这个框架,我们能够计算其实现的正确性证明,并以相对少量的证明树的形式生成证书,这些证明树紧凑,易于阅读和检查,同时封装了大量的案例枚举。我们相信这种特殊类型的证书可以推广到其他离散动力系统,其中的证明涉及大量的情况下枚举以及。

英文摘要:

We study the oritatami model for molecular co-transcriptional folding. In oritatami systems, the transcript (the "molecule") folds as it is synthesized (transcribed), according to a local energy optimisation process, which is similar to how actual biomolecules such as RNA fold into complex shapes and functions as they are transcribed. We prove that there is an oritatami system embedding universal computation in the folding process itself. Our result relies on the development of a generic toolbox, which is easily reusable for future work to design complex functions in oritatami systems. We develop "low-level" tools that allow to easily spread apart the encoding of different "functions" in the transcript, even if they are required to be applied at the same geometrical location in the folding. We build upon these low-level tools, a programming framework with increasing levels of abstraction, from encoding of instructions into the transcript to logical analysis. This framework is similar to the hardware-to-algorithm levels of abstractions in standard algorithm theory. These various levels of abstractions allow to separate the proof of correctness of the global behavior of our system, from the proof of correctness of its implementation. Thanks to this framework, we were able to computerize the proof of correctness of its implementation and produce certificates, in the form of a relatively small number of proof trees, compact and easily readable and checkable by human, while encapsulating huge case enumerations. We believe this particular type of certificates can be generalized to other discrete dynamical systems, where proofs involve large case enumerations as well.

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

↑