Related papers: Computing in continuous space with self-assembling…

Expanding upon the widely recognized notion of mathematical universality in Turing machines, a concept of thermodynamic universality in Turing machines is introduced. Under the physical Church-Turing thesis, the existence of a…

In this paper, we explore relationships between two models of systems which are governed by only the local interactions of large collections of simple components: cellular automata (CA) and the abstract Tile Assembly Model (aTAM). While…

In this thesis we will present and discuss various results pertaining to tiling problems and mathematical logic, specifically computability theory. We focus on Wang prototiles, as defined in [32]. We begin by studying Domino Problems, and…

We review some recent results related to the self-assembly of infinite structures in the Tile Assembly Model. These results include impossibility results, as well as novel tile assembly systems in which shapes and patterns that represent…

General matrix multiplication (GEMM) is the computational backbone of modern AI workloads, and its efficiency is critically dependent on effective tiling strategies. Conventional approaches employ symmetric tile buffering, where the…

We outline the construction of a molecular system that could, in principle, implement a thermodynamically reversible Universal Turing Machine (UTM). By proposing a concrete-albeit idealised-design and operational protocol, we reveal…

In this paper, we prove that in the abstract Tile Assembly Model (aTAM), an accretion-based model which only allows for a single tile to attach to a growing assembly at each step, there are no tile assembly systems capable of…

Computing-in-Memory (CiM) is a promising paradigm to address the memory bottleneck constraining traditional systems. Most power-efficient CiM variants can directly perform Boolean operations in non-volatile memory arrays. Higher…

In this paper, we investigate the computability of thermodynamic invariants at zero temperature for one-dimensional subshifts of finite type. In particular, we prove that the residual entropy (i.e., the joint ground state entropy) is an…

Majumder, Reif and Sahu have presented a stochastic model of reversible, error-permitting, two-dimensional tile self-assembly, and showed that restricted classes of tile assembly systems achieved equilibrium in (expected) polynomial time.…

The connection between self-assembly and computation suggests that a shape can be considered the output of a self-assembly ``program,'' a set of tiles that fit together to create a shape. It seems plausible that the size of the smallest…

We consider high-temperature expansions for the free energy of zero-field Ising models on planar quasiperiodic graphs. For the Penrose and the octagonal Ammann-Beenker tiling, we compute the expansion coefficients up to 18th order. As a…

We present an active tile assembly model which extends Winfree's abstract tile assembly model to tiles that are capable of transmitting and receiving binding site activation signals. In addition, we introduce a mathematical framework to…

The number of complete tilings of m X n floors for tiles of shape 1 X 2, 1 X 3, 1 X 4 and 2 X 3 is computed numerically for floors up to width m=9 and variable floor lengths n. Counts are obtained for two classes, for fixed tile stack…

In this paper, we present high-level overviews of tile-based self-assembling systems capable of producing complex, infinite, aperiodic structures known as discrete self-similar fractals. Fractals have a variety of interesting mathematical…

Tile-based self-assembly systems are capable of universal computation and algorithmically-directed growth. Systems capable of such behavior typically make use of "glue cooperation" in which the glues on at least $2$ sides of a tile must…

Generic computability has been studied in group theory and we now study it in the context of classical computability theory. A set A of natural numbers is generically computable if there is a partial computable function f whose domain has…

We consider staged self-assembly systems, in which square-shaped tiles can be added to bins in several stages. Within these bins, the tiles may connect to each other, depending on the glue types of their edges. Previous work by Demaine et…

By considering a discrete tape where each cell corresponds to an integer, thus to a possible sum, a pseudo-polynomial solution can be given to subset sum problem, which is an NP-complete problem and a cornerstone application for this study,…

We study infinite dimensional tilting modules over a concealed canonical algebra of domestic or tubular type. In the domestic case, such tilting modules are constructed by using the technique of universal localization, and they can be…