Simulation of programmable matter systems using active tile-based self-assembly

DOI10.1007/978-3-030-26807-7_8MaRDI QIDQ2278616zbMATH OpenOpenAlexFDO

Authors John Calvin Alumbaugh, Joshua J. Daymude, Erik D. Demaine, Matthew J. Patitz, Andrea Richa

Publication date 5 December 2019

Full work available at URL https://arxiv.org/abs/1906.01773, https://hdl.handle.net/1721.1/129562

zbMATH Keywords

amoebot modelprogrammable matterself-assemblysimulationtile automata

Mathematics Subject Classification ID

Other nonclassical models of computation (68Q09) Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Cellular automata (computational aspects) (68Q80)

Abstract: Self-assembly refers to the process by which small, simple components mix and combine to form complex structures using only local interactions. Designed as a hybrid between tile assembly models and cellular automata, the Tile Automata (TA) model was recently introduced as a platform to help study connections between various models of self-assembly. However, in this paper we present a result in which we use TA to simulate arbitrary systems within the amoebot model, a theoretical model of programmable matter in which the individual components are relatively simple state machines that are able to sense the states of their neighbors and to move via series of expansions and contractions. We show that for every amoebot system, there is a TA system capable of simulating the local information transmission built into amoebot particles, and that the TA "macrotiles" used to simulate its particles are capable of simulating movement (via attachment and detachment operations) while maintaining the necessary properties of amoebot particle systems. The TA systems are able to utilize only the local interactions of state changes and binding and unbinding along tile edges, but are able to fully simulate the dynamics of these programmable matter systems.

Recommendations

• Freezing simulates non-freezing tile automata
• Intrinsic universality and the computational power of self-assembly
• Dynamic simulation of 1D cellular automata in the Active aTAM
• Intrinsic universality in self-assembly
• scientific article; zbMATH DE number 7357524

Cited in

(15)

• Path finding in the tile assembly model
• Queue-based method for efficient simulation of biological self-assembly systems
• Parallel computation using active self-assembly
• Exploring programmable self-assembly in non-DNA based molecular computing
• The Simulation Powers and Limitations of Hierarchical Self-Assembly Systems
• Automated self-assembly programming paradigm: The impact of network topology
• Parallel Computation Using Active Self-assembly
• ACTIVE TILE SELF-ASSEMBLY, PART 2: SELF-SIMILAR STRUCTURES AND STRUCTURAL RECURSION
• Active Self-Assembly of Simple Units Using an Insertion Primitive
• Signal Passing Self-Assembly Simulates Tile Automata
• Verification and computation in restricted tile automata
• Building squares with optimal state complexity in restricted active self-assembly
• Simulation of multiple stages in single bin active tile self-assembly
• The impacts of dimensionality, diffusion, and directedness on intrinsic cross-model simulation in tile-based self-assembly
• On the simulation power of surface chemical reaction networks

This page was built for publication: Simulation of programmable matter systems using active tile-based self-assembly

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2278616)