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

温度为1时的有效平方和图灵普适性

Efficient Squares and Turing Universality at Temperature 1 with a Unique Negative Glue

Matthew J. Patitz, Robert T. Schweller, Scott M. Summers

摘要:

Winfree的抽象瓦片组装模型(aTAM)“强大吗?好吧,如果某些瓷砖需要“配合”以便能够结合到生长的瓷砖组件(也称为,温度2自组装),则图灵通用计算和$N \times N$正方形的有效自组装在aTAM中是可实现的(Rotemund和Winfree,STOC 2000)。所以,是的,在计算的意义上,aTAM是相当强大的!然而,如果完全去除这种协同性条件(也称为,温度1自组装),那么aTAM的计算“能力”(即,其支持图灵通用计算和$N \times N$正方形的有效自组装的能力)变得未知。有利的一面是,在温度1下,aTAM不仅是图灵通用的,而且如果允许自组装利用三个空间维度,则还支持有效的自组装$N \times N$正方形(Fu,Schweller和Cook,SODA 2011)。我们研究了一个看似简单的,限制性的瓷砖组装系统(TAS)的理论“权力”,其中(1)每个胶水强度的绝对值为1,(2)有一个单一的负强度胶水类型和(3)不等的胶水不能相互作用。我们称之为\emph{restricted glue} TAS(rgTAS)。我们首先展示了用rgTAS生成$N \times N$正方形的图块复杂度是$O(\frac{\log n}{\log \log n})$。我们还证明了rgTAS是图灵通用的构造,模拟任意图灵机。接下来,我们提供了rgTAS类的一个变化,部分限制胶TAS,这是类似的,除了负胶的强度的大小只能假设为$\ge 1$。这些结果包括用于构建$N \times N$正方形的具有$O(\log n)$瓦片复杂性的构造,以及模拟图灵机但具有比rgTAS构造更大的缩放因子的构造。

英文摘要:

Is Winfree's abstract Tile Assembly Model (aTAM) "powerful?" Well, if certain tiles are required to "cooperate" in order to be able to bind to a growing tile assembly (a.k.a., temperature 2 self-assembly), then Turing universal computation and the efficient self-assembly of $N \times N$ squares is achievable in the aTAM (Rotemund and Winfree, STOC 2000). So yes, in a computational sense, the aTAM is quite powerful! However, if one completely removes this cooperativity condition (a.k.a., temperature 1 self-assembly), then the computational "power" of the aTAM (i.e., its ability to support Turing universal computation and the efficient self-assembly of $N \times N$ squares) becomes unknown. On the plus side, the aTAM, at temperature 1, isn't only Turing universal but also supports the efficient self-assembly $N \times N$ squares if self-assembly is allowed to utilize three spatial dimensions (Fu, Schweller and Cook, SODA 2011). We investigate the theoretical "power" of a seemingly simple, restrictive class of tile assembly systems (TASs) in which (1) the absolute value of every glue strength is 1, (2) there's a single negative strength glue type and (3) unequal glues can't interact. We call these the \emph{restricted glue} TASs (rgTAS). We first show the tile complexity of producing an $N \times N$ square with an rgTAS is $O(\frac{\log n}{\log \log n})$. We also prove that rgTASs are Turing universal with a construction that simulates an arbitrary Turing machine. Next, we provide results for a variation of the rgTAS class, partially restricted glue TASs, which is similar except that the magnitude of the negative glue's strength can only assumed to be $\ge 1$. These results consist of a construction with $O(\log n)$ tile complexity for building $N \times N$ squares, and one which simulates a Turing machine but with a greater scaling factor than for the rgTAS construction.

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

↑