Student or educator? Sign up with your school email and get 6 months of Pro free.
CoChat
Cited by 252

The DOI matches its Crossref record; 2 of the 2 references it cites were found in a registry or an index.

Complexity of Self‐Assembled Shapes

Open access
Soloveichik, David, Winfree, Erik · 2007 · SIAM Journal on Computing

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, we develop a universal constructor for this model of self‐assembly that can execute an arbitrary Turing machine program specifying how to grow a shape. Our result implies, somewhat counterintuitively, 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 bit strings 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 nondeterministic Turing machines.

Overview

The claims and statistics of this paper haven’t been checked yet.

Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.

A few free checks a day · papers already verified open instantly · results are public

Integrity signals

Registry

Crossref · 10.1137/s0097539704446712

Cites

2 of 2 references verified0 citation errors · 0 not checkable

Statistics

Verification

Claims the paper makes

The claims and statistics of this paper haven’t been checked yet.

Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.

A few free checks a day · papers already verified open instantly · results are public

Self-check

Percentages, sums and reported differences re-computed from the paper’s own numbers.

The self-check needs the paper’s full text.

Citations

Cites

Show all 2 references

Cited by

See all 252

Metadata

Authors
Soloveichik, D., & Winfree, E.
Venue
SIAM Journal on Computing
Published
2007-01
Volume
36
Issue
6
Pages
1544-1569
ISSN
  • 0097-5397 (ISSN-L)
  • 1095-7111
OpenAlex
W2508617531
Cited by
252
References
2
FWCI
8.38
Type
journal article
Language
en
Open access
green

About these checks

Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.

Statistics and arithmetic are recomputed, not judged.

Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.

What counts as a claim ›How we measure confidence ›How we check this ›

Are you an author, or do you see a problem with this page? Request a review

How to cite

Cite CoChat for the checks on this page, and the paper for its own findings.

This page
CoChat. (2026). Citation check: Complexity of Self‐Assembled Shapes. https://app.cochat.ai/papers/10.1137/s0097539704446712
The paper
Soloveichik, D., & Winfree, E. (2007). Complexity of Self‐Assembled Shapes. SIAM Journal on Computing. https://doi.org/10.1137/s0097539704446712

Data sources

Bibliographic data: Semantic Scholar, OpenAlex, Crossref.

Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).

Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.