Path finding in the tile assembly model
From MaRDI portal
Publication:1008725
DOI10.1016/j.tcs.2008.12.008zbMath1163.68017MaRDI QIDQ1008725
Publication date: 30 March 2009
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.tcs.2008.12.008
robotics; crystal growth; self-assembly; tile assembly model; amorphous computing; path-finding; natural computation; molecular computation; swarm computing
68Q10: Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.)
68T40: Artificial intelligence for robotics
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Arithmetic computation in the tile assembly model: addition and multiplication
- Nondeterministic polynomial time factoring in the tile assembly model
- Solving NP-complete problems in the tile assembly model
- On the solvability of domino snake problems
- Undecidability and nonperiodicity for tilings of the plane
- The program-size complexity of self-assembled squares (extended abstract)
- Combinatorial optimization problems in self-assembly
- Reducing tile complexity for self-assembly through temperature programming
- Self-correcting Self-assembly: Growth Models and the Hammersley Process
- The Undecidability of the Infinite Ribbon Problem: Implications for Computing by Self-Assembly
- Undecidability Of Some Domino Connectability Problems
- Complexities for Generalized Models of Self-Assembly
- DNA Computing
- DNA Computing
- The undecidability of the domino problem
- DNA Computing
- DNA Computing