arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1901.08575cs.CCcs.CGcs.DS
收藏

确定性二维温度-1瓦片装配系统无法计算

Deterministic 2-Dimensional Temperature-1 Tile Assembly Systems Cannot Compute

Jérôme Durand-Lose, Hendrik Jan Hoogeboom, Nataša Jonoska

摘要:

我们认为非合作绑定在所谓的“温度1”,在确定性(这里称为{ \it汇合})瓷砖自组装系统(1-TAS),并证明了常设猜想,这样的系统不具有普遍的计算能力。我们称一个TAS的最大组件包含至少一个最终周期的组装路径{ \it para-periodic}。我们观察到,合流1-TAS有最多一个最大的可生产的组装,$α_{max}$,可以被认为是一个联盟的路径组件,我们表明,这样的系统总是para-periodic。这个结果是通过两条路径的叠加和组合得到的,这两条路径产生了一条具有所需属性的新路径,我们称之为两条路径的\emph{co-grow}技术。此外,我们提供了一个融合的1-TAS的$α_{max}$作为两种可能的情况下,所谓的,一个网格或不相交的联合梳之一的表征。对于给定的$α_{max}$,我们可以关联一个有限标记图,称为\emph{quipu},使得quipu中所有路径标记的并集等于$α_{max}$,因此给出了$α_{max}$的有限描述。这种有限描述意味着$α_{max}$是$\mathbb{Z}^2$的半仿射子集的并集,并且由于这种有限描述可以从任何1-TAS算法生成,1-TAS不能具有通用计算能力。

英文摘要:

We consider non cooperative binding in so called `temperature 1', in deterministic (here called {\it confluent}) tile self-assembly systems (1-TAS) and prove the standing conjecture that such systems do not have universal computational power. We call a TAS whose maximal assemblies contain at least one ultimately periodic assembly path {\it para-periodic}. We observe that a confluent 1-TAS has at most one maximal producible assembly, $α_{max}$, that can be considered a union of path assemblies, and we show that such a system is always para-periodic. This result is obtained through a superposition and a combination of two paths that produce a new path with desired properties, a technique that we call \emph{co-grow} of two paths. Moreover we provide a characterization of an $α_{max}$ of a confluent 1-TAS as one of two possible cases, so called, a grid or a disjoint union of combs. To a given $α_{max}$ we can associate a finite labeled graph, called \emph{quipu}, such that the union of all labels of paths in the quipu equals $α_{max}$, therefore giving a finite description for $α_{max}$. This finite description implies that $α_{max}$ is a union of semi-affine subsets of $\mathbb{Z}^2$ and since such a finite description can be algorithmicly generated from any 1-TAS, 1-TAS cannot have universal computational power.

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

↑