SPIE Research Talk

Timothy Gomez will be giving a talk on April 2nd to the UTRGV chapter of the International Society for Optics and Photonics (SPIE). The talk is an overview of some of his recent self-assembly research. The title is “MolecularComputation: Self-Assembling Tile Computers.” Please see the UTRGV SPIE page for full details.

Journal paper published in Natural Computing

Since UCNC did not happen this year, they issued a CFP for a special issue of Natural Computing. We had a paper titled “Fast Reconfiguration of Robot Swarms with Uniform Control Signals” accepted. The authors are David Caballero, Angel A. Cantu, Timothy Gomez, Austin Luchsinger, Robert Schweller, and Tim Wylie.

Engaged Scholarships Awarded

Congratulations to two research students that have received Engaged Scholarships from the UTRGV Office of Engaged Scholarship and Learning! They offer research funding for undergraduates wanting to do research. The students then participate in a symposium of the scholars.

The two projects and students awarded funding are:
Thomas Thirlwall – Robot Sorting with Uniform External Forces
Kaiwei Sung – 3 Dimensional Single Step Tilt

New paper in the Journal of Information Processing

A new paper has been published in the Journal of Information Processing. This is a full extended version of the short abstract from JCDCG3 last year.
Title: Hardness of Reconfiguring Robot Swarms with Uniform External Control in Limited Directions
Authors: David Caballero, Angel A. Cantu, Timothy Gomez, Austin Luchsinger, Robert Schweller, and Tim Wylie

There is also an Arxiv version: https://arxiv.org/abs/2003.13097

Paper accepted to ISAAC 2020

One of our papers has been accepted to the International Symposium on Algorithms and Computation (ISAAC) for this year.

Title: Signal Passing Self-Assembly Simulates Tile Automata

Authors: Angel A. Cantu, Austin Luchsinger, Robert Schweller, and Tim Wylie

Verification and Computation in Restricted Tile Automata

Title: Verification and Computation in Restricted Tile Automata

Authors: David Caballero, Timothy Gomez, Robert Schweller, and Tim Wylie

Conference: The 26th International Conference on DNA Computing and Molecular Programming (DNA’20), 2020


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.