Related papers: Computing in continuous space with self-assembling…
We show how to design a universal shape replicator in a self-assembly system with both attractive and repulsive forces. More precisely, we show that there is a universal set of constant-size objects that, when added to any unknown hole-free…
We introduce the notion of universal memcomputing machines (UMMs): a class of brain-inspired general-purpose computing machines based on systems with memory, whereby processing and storing of information occur on the same physical location.…
This paper focuses on the undecidability of translational tiling of $n$-dimensional space $\mathbb{Z}^n$ with a set of $k$ tiles. It is known that tiling $\mathbb{Z}^2$ with translated copies with a set of $8$ tiles is undecidable.…
Computation is an input-output process, where a program encoding a problem to be solved is inserted into a machine that outputs a solution. Quantum computation conventionally relies on classical, external control outside the quantum…
This study explores the properties of the function which can tile the field $\mathbb{Q}_p$ of $p$-adic numbers by translation. It is established that functions capable of tiling $\mathbb{Q}_p$ is by translation uniformly locally constancy.…
At low temperatures ultrasoft particle systems develop interesting phases via the self-assembly of particle clusters. In this study we develop a general zero-temperature analysis fully characterizing the ground state of such models in two…
We present a construction of a family of non-periodic tilings using elementary tools such as modular arithmetic and vector geometry. These tilings exhibit a distinct type of structural regularity, which we term modulo-staggered rotational…
Additive Manufacturing (AM) is a manufacturing paradigm that builds three-dimensional objects from a computer-aided design model by successively adding material layer by layer. AM has become very popular in the past decade due to its…
A new family of decagonal quasiperiodic tilings are constructed by the use of generalized point substitution processes, which is a new substitution formalism developed by the author [N. Fujita, Acta Cryst. A 65, 342 (2009)]. These tilings…
We give a construction of a self-similar tiling of the plane with any prescribed expansion coefficient $\lambda\in\C$ (satisfying the necessary algebraic condition of being a complex Perron number). For any integer $m>1$ we show that there…
We introduce a new family of nonperiodic tilings, based on a substitution rule that generalizes the pinwheel tiling of Conway and Radin. In each tiling the tiles are similar to a single triangular prototile. In a countable number of cases,…
In this paper, we prove that given any \Pi^0_1 subset $P$ of $\{0,1\}^\NN$ there is a tileset $\tau$ with a set of configurations $C$ such that $P\times\ZZ^2$ is recursively homeomorphic to $C\setminus U$ where $U$ is a computable set of…
Developing a thermodynamic theory of computation is a challenging task at the interface of non-equilibrium thermodynamics and computer science. In particular, this task requires dealing with difficulties such as stochastic halting times,…
While transformer models have been highly successful, they are computationally inefficient. We observe that for each layer, the full width of the layer may be needed only for a small subset of tokens inside a batch and that the "effective"…
We prove that an effective temperature naturally emerges from the algorithmic structure of a regular universal Turing machine (UTM), without introducing any external physical parameter. In particular, the redundancy growth of the machine's…
We describe computer algorithms that produce the complete set of isohedral tilings by n-omino or n-iamond tiles in which the tiles are fundamental domains and the tilings have 3-, 4-, or 6-fold rotational symmetry. The symmetry groups of…
Translational tiling problems are among the most fundamental and representative undecidable problems in all fields of mathematics. Greenfeld and Tao obtained two remarkable results on the undecidability of translational tiling in recent…
In this paper, we introduce the following problem in the theory of algorithmic self-assembly: given an input shape as the seed of a tile-based self-assembly system, design a finite tile set that can, in some sense, uniquely identify whether…
In topology, a torus remains invariant under certain non-trivial transformations known as modular transformations. In the context of topologically ordered quantum states of matter, these transformations encode the braiding statistics and…
Tile Automata is a recently defined model of self-assembly that borrows many concepts from cellular automata to create active self-assembling systems where changes may be occurring within an assembly without requiring attachment. This model…