Many models of self-assembly have been shown to be capable of performing computation. Tile Automata was recently introduced combining features of both Celluar Automata and the 2-Handed Model of self-assembly both capable of universal computation. In this work we study the complexity of Tile Automata utilizing features inherited from the two models mentioned above. We first present a construction for simulating Turing Machines that performs both covert and fuel efficient computation. We then explore the capabilities of limited Tile Automata systems such as 1-Dimensional systems (all assemblies are of height 1) and freezing Systems (tiles may not repeat states). Using these results we provide a connection between the problem of finding the largest uniquely producible assembly using n states and the busy beaver problem for non-freezing systems and provide a freezing system capable of uniquely assembling an assembly whose length is exponential in the number of states of the system. We finish by exploring the complexity of the Unique Assembly Verification problem in Tile Automata with different limitations such as freezing and systems without the power of detachment.
Caballero, D., Gomez, T., Schweller, R., & Wylie, T. (2020). Verification and Computation in Restricted Tile Automata. In C. Geary & M. J. Patitz (Eds.), 26th International Conference on DNA Computing and Molecular Programming (DNA 26) (Vol. 174, p. 10:1–10:18). Schloss Dagstuhl–Leibniz-Zentrum für Informatik. https://doi.org/10.4230/LIPIcs.DNA.2020.10
Creative Commons License
This work is licensed under a Creative Commons Attribution 3.0 License.
26th International Conference on DNA Computing and Molecular Programming (DNA 26)