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

基于Tile自组装的热力学有利计算

Thermodynamically Favorable Computation via Tile Self-assembly

Cameron Chalk, Jacob Hendricks, Matthew J. Patitz, Michael Sharp

摘要:

最近引入的热力学结合网络(TBN)模型是为了研究自组装系统而开发的,其目的是通过关注其化学上有利的最终状态,而忽略它们演变的动力学途径。该模型是有意开发的,不仅抽象了时间的概念,而且还抽象了几何的约束。分析具有结合结构域的单体的集合,所述结合结构域允许它们通过互补键形成聚合物,以确定它们的最终稳定构型,所述最终稳定构型是使形成的键的数量(即焓)和独立组分的数量(即熵)最大化的那些构型。在本文中,我们首先开发了一个定义,它意味着什么TBN执行计算,然后提出了一组结构,能够执行计算,通过模拟空间有界图灵机和布尔电路的行为。与以前的TBN结果相反,这些结构对系统中存在的单体计数和平行形成的聚合物数量的巨大变化是稳健的。虽然图灵机模拟TBN的独特的单体类型所需的数量方面是低效的,相比,算法自组装系统的抽象瓷砖组装模型(aTAM),然后,我们表明,移植这些aTAM系统设计TBN的一般策略产生TBN不正确地模拟计算。最后,我们提出了一种改进的TBN模型,我们称之为几何热力学结合网络(GTBN)模型,其中单体被定义为刚性几何形状,并形成刚性键。利用几何形状的约束,我们然后提供了一个GTBN建设能够有效地模拟图灵机的aTAM。

英文摘要:

The recently introduced Thermodynamic Binding Networks (TBN) model was developed with the purpose of studying self-assembling systems by focusing on their thermodynamically favorable final states, and ignoring the kinetic pathways through which they evolve. The model was intentionally developed to abstract away not only the notion of time, but also the constraints of geometry. Collections of monomers with binding domains which allow them to form polymers via complementary bonds are analyzed to determine their final, stable configurations, which are those which maximize the number of bonds formed (i.e. enthalpy) and the number of independent components (i.e. entropy). In this paper, we first develop a definition of what it means for a TBN to perform a computation, and then present a set of constructions which are capable of performing computations by simulating the behaviors of space-bounded Turing machines and boolean circuits. In contrast to previous TBN results, these constructions are robust to great variability in the counts of monomers existing in the systems and the numbers of polymers that form in parallel. Although the Turing machine simulating TBNs are inefficient in terms of the numbers of unique monomer types required, as compared to algorithmic self-assembling systems in the abstract Tile Assembly Model (aTAM), we then show that a general strategy of porting those aTAM system designs to TBNs produces TBNs which incorrectly simulate computations. Finally, we present a refinement of the TBN model which we call the Geometric Thermodynamic Binding Networks (GTBN) model in which monomers are defined with rigid geometries and form rigid bonds. Utilizing the constraints imposed by geometry, we then provide a GTBN construction capable of simulating Turing machines as efficiently as in the aTAM.

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

↑