Deprecated: $wgMWOAuthSharedUserIDs=false is deprecated, set $wgMWOAuthSharedUserIDs=true, $wgMWOAuthSharedUserSource='local' instead [Called from MediaWiki\HookContainer\HookContainer::run in /var/www/html/w/includes/HookContainer/HookContainer.php at line 135] in /var/www/html/w/includes/Debug/MWDebug.php on line 372
Intrinsic universality in tile self-assembly requires cooperation - MaRDI portal

Intrinsic universality in tile self-assembly requires cooperation

From MaRDI portal
Publication:5384017

DOI10.1137/1.9781611973402.56zbMath1422.68071arXiv1304.1679OpenAlexW2949497251MaRDI QIDQ5384017

Andrew Winslow, Pierre-Étienne Meunier, Guillaume Theyssier, Damien Woods, Scott M. Summers, Matthew J. Patitz

Publication date: 20 June 2019

Published in: Proceedings of the Twenty-Fifth Annual ACM-SIAM Symposium on Discrete Algorithms (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1304.1679




Related Items (26)

Unraveling simplicity in elementary cellular automataOptimal self-assembly of finite shapes at temperature 1 in 3DStrict self-assembly of fractals using multiple handsThe power of duples (in self-assembly): it's not so hip to be squareSelf-assembly of 4-sided fractals in the two-handed tile assembly modelOn the complexity of two-dimensional signed majority cellular automataScaled Tree Fractals Do not Strictly Self-assembleThe Simulation Powers and Limitations of Hierarchical Self-Assembly SystemsImproved lower and upper bounds on the tile complexity of uniquely self-assembling a thin rectangle non-cooperatively in 3DResiliency to multiple nucleation in temperature-1 self-assemblyCommunication complexity meets cellular automata: necessary conditions for intrinsic universalityBuilding squares with optimal state complexity in restricted active self-assemblyTight bounds on the directed tile complexity of a just-barely 3D \(2 \times N\) rectangle at temperature 1Particle computation: complexity, algorithms, and logicThe need for seed (in the abstract Tile Assembly Model)Binary pattern tile set synthesis is NP-hardNearly constant tile complexity for any shape in two-handed tile assemblyDoubles and negatives are positive (in self-assembly)Fast arithmetic in algorithmic self-assemblySize-separable tile self-assembly: a tight bound for temperature-1 mismatch-free systemsParallel computation using active self-assemblyGeometric tiles and powers and limitations of geometric hindrance in self-assemblySelf-assembly of and optimal encoding within thin rectangles at temperature-1 in 3DScaled pier fractals do not strictly self-assembleAn introduction to tile-based self-assembly and a survey of recent resultsThe two-handed tile assembly model is not intrinsically universal




This page was built for publication: Intrinsic universality in tile self-assembly requires cooperation