Related papers: Computing in continuous space with self-assembling…
The ability to design and synthesize ever more complicated colloidal particles opens the possibility of self-assembling a zoo of complex structures, including those with one or more self-limited length scales. An undesirable feature of…
Anyons obtained from a finite gauge theory have a computational power that depends on the symmetry group. The relationship between group structure and computational power is discussed in this paper. In particular, it is shown that anyons…
We study the structure of the digit sets ${\mathcal D}$ for the integral self-similar tiles $T(b,{\mathcal{D}})$ (we call such ${\mathcal D}$ a {\it tile digit set} with respect to $b$). So far the only available classes of such tile digit…
Aperiodic tilings are non-periodic tilings characterized by local constraints. They play a key role in the proof of the undecidability of the domino problem (1964) and naturally model quasicrystals (discovered in 1982). A central question…
We introduce staged self-assembly of Wang tiles, where tiles can be added dynamically in sequence and where intermediate constructions can be stored for later mixing. This model and its various constraints and performance measures are…
We derive the semiclassical series for the partition function of a one-dimensional quantum-mechanical system consisting of a particle in a single-well potential. We do this by applying the method of steepest descent to the path-integral…
Boolean algebra, the branch of mathematics where variables can assume only true or false value, is the theoretical basis of classical computation. The analogy between Boolean operations and electronic switching circuits, highlighted by…
Turing Machines (TMs) are the canonical model of computation in computer science and physics. We combine techniques from algorithmic information theory and stochastic thermodynamics to analyze the thermodynamic costs of TMs. We consider two…
The tiling problem has been a famous problem that has appeared in many Mathematics problems. Many of its solutions are rooted in high-level Mathematics. Thus we hope to tackle this problem using more elementary Mathematics concepts. In this…
We use computational modeling to investigate the assembly thermodynamics of a particle-based model for geometrically frustrated assembly, in which the local packing geometry of subunits is incompatible with uniform, strain-free large-scale…
If particles interact according to isotropic pair potentials that favor multiple length scales, in principle a large variety of different complex structures can be achieved by self-assembly. We present, motivate, and discuss a conjecture…
We establish a local model for the moduli space of holomorphic symplectic structures with logarithmic poles, near the locus of structures whose polar divisor is normal crossings. In contrast to the case without poles, the moduli space is…
Programs admitting a polyhedral representation can be transformed in many ways for locality and parallelism, notably loop tiling. Data flow analysis can then compute dependence relations between iterations and between tiles. When tiling is…
We develop a recursive formula for counting the number of rectangulations of a square, i.e the number of combinatorially distinct tilings of a square by rectangles. Our formula specializes to give a formula counting generic rectangulations,…
Let n be a positive integer, and let R be a finitely presented (but not necessarily finite dimensional) associative algebra over a computable field. We examine algorithmic tests for deciding (1) if every n-dimensional representation of R is…
The design of irregular planar phased arrays (PAs) characterized by a highly-modular architecture is addressed. By exploiting the property of self-replicating tile shapes, also known as rep-tiles, the arising array layouts consist of tiles…
This work studies some aspects of the computational power of fully asynchronous cellular automata (ACA). We deal with some notions of simulation between ACA and Turing Machines. In particular, we characterize the updating sequences…
We study the problem of perfect tiling in the plane and exploring the possibility of tiling a rectangle using integral distinct squares. Assume a set of distinguishable squares (or equivalently a set of distinct natural numbers) is given,…
We know that tilesets that can tile the plane always admit a quasi-periodic tiling [4, 8], yet they hold many uncomputable properties [3, 11, 21, 25]. The quasi-periodicity function is one way to measure the regularity of a quasi-periodic…
Computation, if treated as a set of physical processes that act on information represented by states of matter, encompasses biological systems, digital systems, and other constructs, and may be a fundamental measure of living systems. The…