Complexity of Self-Assembled Shapes

Abstract

The connection between self-assembly and computation suggests that a shape can be considered the output of a self-assembly ``program,'' a set of tiles that fit together to create a shape. It seems plausible that the size of the smallest self-assembly program that builds a shape and the shape's descriptional (Kolmogorov) complexity should be related. We show that when using a notion of a shape that is independent of scale, this is indeed so: in the Tile Assembly Model, the minimal number of distinct tile types necessary to self-assemble a shape, at some scale, can be bounded both above and below in terms of the shape's Kolmogorov complexity. As part of the proof of the main result, we sketch a general method for converting a program outputting a shape as a list of locations into a set of tile types that self-assembles into a scaled up version of that shape. Our result implies, somewhat counter-intuitively, that self-assembly of a scaled-up version of a shape often requires fewer tile types. Furthermore, the independence of scale in self-assembly theory appears to play the same crucial role as the independence of running time in the theory of computability. This leads to an elegant formulation of languages of shapes generated by self-assembly. Considering functions from integers to shapes, we show that the running-time complexity, with respect to Turing machines, is polynomially equivalent to the scale complexity of the same function implemented via self-assembly by a finite set of tile types. Our results also hold for shapes defined by Wang tiling -- where there is no sense of a self-assembly process -- except that here time complexity must be measured with respect to non-deterministic Turing machines.

Extended abstract appears in DNA Computing 10; this is the full version and will be submitted elsewhere. 25 pages

Cited by in corpus (31)

• Integrated information increases with fitness in the evolution of animats
• A Probabilistic Framework for Quantifying Biological Complexity
• Programmable Control of Nucleation for Algorithmic Self-Assembly
• Self-assembly, modularity and physical complexity
• Evolutionary Dynamics in a Simple Model of Self-Assembly
• Designing the self-assembly of arbitrary shapes using minimal complexity building blocks
• Information content of colored motifs in complex networks
• Computing in continuous space with self-assembling polygonal tiles
• Intrinsic universality and the computational power of self-assembly
• Kinetic Trans-assembly of DNA Nanostructures
• Efficient Squares and Turing Universality at Temperature 1 with a Unique Negative Glue
• The self-assembly of paths and squares at temperature 1
• Freezing Transitions in Liquids Characterized by a Favoured Local Structure
• Staged Self-Assembly and Polyomino Context-Free Grammars
• A pumping lemma for non-cooperative self-assembly
• Self-Assembling Systems are Distributed Systems
• Self-Assembly with Geometric Tiles
• Self-Assembly as Graph Grammar as Distributed System
• Connected Assembly and Reconfiguration by Finite Automata
• Approximate Self-Assembly of the Sierpinski Triangle
• Asynchronous Signal Passing for Tile Self-Assembly: Fuel Efficient Computation and Efficient Assembly of Shapes
• Program Size and Temperature in Self-Assembly
• Directed Self-Assembly of Linear Nanostructures by Optimal Control of External Electrical Fields
• Non-cooperatively assembling large structures: a 2D pumping lemma cannot be as powerful as its 1D counterpart
• More Tight Bounds for Active Self-Assembly Using an Insertion Primitive
• Self-Assembly of a Statistically Self-Similar Fractal
• Optimal self-assembly of finite shapes at temperature 1 in 3D
• Distributed Agreement in Tile Self-Assembly
• Randomized Self-Assembly for Exact Shapes
• Optimization of supply diversity for the self-assembly of simple objects in two and three dimensions
• The non-cooperative tile assembly model is not intrinsically universal or capable of bounded Turing machine simulation