RNA is a chain of ribonucleotides of four kinds (denoted respectively by the letters A, C, G, U). While being synthesized sequentially from its template DNA (transcription), it folds upon itself into intricate higher-dimensional structures in such a way that the free energy is minimized, that is, the more hydrogen bonds between ribonucletoides or larger entropy a structure has, the more likely it is chosen, and furthermore the minimization is done locally. This phenomenon is called cotranscriptional folding (CF). It has turned out to play significant roles in in-vivo computation throughout experiments and recently proven even programmable artificially so as to self-assemble a specific RNA rectangular tile structure in vitro. The next step is to program a computation onto DNA in such a way that the computation can be "called" by cotranscriptional folding. In this novel paradigm of computation, what programmers could do is only twofold: designing a template DNA and setting environmental parameters. Oritatami is an introductory "toy" model to this paradigm of computation. In this model, programmars are also allowed to employ an arbitrarily large finite alphabet ∑ as well as an arbitrarily complex rule set for binding over ∑ x ∑. We shall present known architectures of computing in the oritatami model from a simple half-adder to Turing machine along with several programming techniques of use, with hope that they will inspire in-vivo architectures of CF-driven self-assemblable computers, which could be even heritable.
展开▼
机译：RNA是四种核糖核苷酸链（分别由字母A，C，G，U表示）。当从其模板DNA（转录）顺序合成时，它以使自由能最小化的方式自身折叠成复杂的高维结构，即，核糖核酸之间的氢键更多或结构具有更大的熵，它更有可能被选择，而且最小化是在本地完成的。这种现象称为共转录折叠（CF）。事实证明，它在整个实验的体内计算中发挥着重要作用，最近证明甚至可以人工编程，以便在体外自组装特定的RNA矩形图块结构。下一步是将计算程序编程到DNA上，以便可以通过共转录折叠来“调用”该计算程序。在这种新颖的计算范式中，程序员只能做两件事：设计模板DNA和设置环境参数。 Oritatami是这种计算范例的入门“玩具”模型。在此模型中，程序设计人员还可以采用任意大的有限字母∑和任意复杂的规则集来绑定∑ x ∑。我们将介绍oritatami模型中从简单的半加法器到Turing机的oritatami模型中的已知计算体系结构，以及几种使用的编程技术，希望它们能启发CF驱动的可自我组装计算机的体内体系结构。甚至是可遗传的。
展开▼
