Self-assembly of shapes at constant scale using repulsive forces
Self-assembly of shapes at constant scale using repulsive forces
复制标题
DOI：
10.1007/s11047-018-9707-9
复制
发表时间：
2016-08
影响因子：
2.1
通讯作者：
Austin Luchsinger;R. Schweller;Tim Wylie
中科院分区：
文献类型：
--
作者：
Austin Luchsinger;R. Schweller;Tim Wylie
形状的算法自组装已经在几种自组装模型中得到了考虑。对于形状构造问题，我们考虑了一种扩展的双手瓷砖组装模型，它包含正(吸引)和负(排斥)相互作用。因此，部件的某些部分可能会变得不稳定并分离。在该模型中，我们利用省油计算来执行图灵机模拟形状的构造。在这篇文章中，我们展示了如何使用渐近最优数量的不同瓦片类型(基于形状的Kolmogorov复杂性)来构造任意形状。我们在这个简单的模型中实现了ATO(1)标度因子，而以前所有使用次线性标度因子的结果都利用了强大的自组装模型，该模型包含了分段、瓦片删除、化学反应网络和瓦片激活/失活等特征。此外，我们结果中的计算和构造只创建了固定大小的垃圾装配，作为装配形状的副产品。
The algorithmic self-assembly of shapes has been considered in several models of self-assembly. For the problem ofshape construction, we consider an extended version of the two-handed tile assembly model, which contains positive (attractive) and negative (repulsive) interactions. As a result, portions of an assembly can become unstable and detach. In this model, we utilize fuel-efficient computation to perform Turing machine simulations for the construction of the shape. In this paper, we show how an arbitrary shape can be constructed using an asymptotically optimal number of distinct tile types (based on the shape’s Kolmogorov complexity). We achieve this atO(1) scale factor in this straightforward model, whereas all previous results with sublinear scale factors utilize powerful self-assembly models containing features such as staging, tile deletion, chemical reaction networks, and tile activation/deactivation. Furthermore, the computation and construction in our result only creates constant-size garbage assemblies as a byproduct of assembling the shape.