Related papers: Some halting problems for abelian sandpiles are un…
We investigate the impact of Knightian uncertainty on the optimal timing policy of an ambiguity averse decision maker in the case where the underlying factor dynamics follow a multidimensional Brownian motion and the exercise payoff depends…
Using a novel rewriting problem, we show that several natural decision problems about finite automata are undecidable (i.e., recursively unsolvable). In contrast, we also prove three related problems are decidable. We apply one result to…
In the prototype sandpile model of self-organized criticality time series obtained by decomposing avalanches into waves of toppling show intermittent fluctuations. The q-th moments of wave size differences possess local multiscaling and…
The Turing machine halting problem can be explained by several factors, including arithmetic logic irreversibility and memory erasure, which contribute to computational uncertainty due to information loss during computation. Essentially,…
We consider the problem of separability: decide whether a Hermitian operator on a finite dimensional Hilbert tensor product is separable or entangled. We show that the tensor convolution defined for certain mappings on an almost arbitrary…
This essay aims to propose construction theory, a new domain of theoretical research on machine construction, and use it to shed light on a fundamental relationship between living and computational systems. Specifically, we argue that…
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.…
For the additive real BSS machines using only constants 0 and 1 and order tests we consider the corresponding Turing reducibility and characterize some semi-decidable decision problems over the reals. In order to refine, step-by-step, a…
One of the most fundamental problems in tiling theory is the domino problem: given a set of tiles and tiling rules, decide if there exists a way to tile the plane using copies of tiles and following their rules. The problem is known to be…
We perform large-scale simulations of directed sandpile models with both deterministic and stochastic toppling rules. Our results show the existence of two distinct universality classes. We also provide numerical simulations of directed…
The Abelian sandpile model serves as a canonical example of self-organized criticality. This critical behavior manifests itself through large cascading events triggered by small perturbations. Such large-scale events, known as avalanches,…
By working with coefficients in $\mathbb{Z}$ or $\mathbb{R}$, one can define two different notions of stability for a sandpile on a graph. We call a sandpile immutable when these notions agree. Our main results give linear-algebraic…
An interesting feature of growth in animals is that different parts of the body grow at approximately the same rate. This property is called proportionate growth. In this paper, we review our recent work on patterns formed by adding $N$…
We study universality classes and crossover behaviors in non-Abelian directed sandpile models, in terms of the metastable pattern analysis. The non-Abelian property induces spatially correlated metastable patterns, characterized by the…
We study stochastic sandpile models with a height restriction in one and two dimensions. A site can topple if it has a height of two, as in Manna's model, but, in contrast to previously studied sandpiles, here the height (or number of…
We investigate the computational complexity of the timed prediction problem in two-dimensional sandpile models. This question refines the classical prediction problem, which asks whether a cell q will eventually become unstable after adding…
In this paper, we consider iterative propositional calculi, which are finite sets of propositional formulas together with the rules of modus ponens and weak substitution (when formula being substituted must be already inferred). We…
There are several forms of irreducibility in computing systems, ranging from undecidability to intractability to nonlinearity. This paper is an exploration of the conceptual issues that have arisen in the course of investigating speed-up…
The Bak-Tang-Wiesenfeld (BTW) sandpile model is a cellular automaton which has been intensively studied during the last years as a paradigm for self-organized criticality. In this paper, we reconsider a deterministic version of the BTW…
When working with (multi-parameter) persistence modules, one usually makes some type of tameness assumption in order to obtain better control over their algebraic behavior. One such notion is Ezra Millers notion of finite encodability,…