Reversible computing is a paradigm where computing models are defined so that they
reflect physical reversibility, one of the fundamental microscopic physical property of Nature …

A cellular automaton is a dynamical system on an infinite array of cells defined by a local
update rule that is applied simultaneously at all cells. By carefully choosing the update rule …

We investigate the decidability of the periodicity and the immortality problems in three
models of reversible computation: reversible counter machines, reversible Turing machines …

A two-way reversible multi-head finite automaton (RMFA) is introduced as a simple model of
reversible computing, and its language accepting capability is studied. We show that various …

We study the controlled reversibility in reaction systems, a bio-inspired formalism in which
the reactions take place only if some inhibitors are not present. Forward reactions are …

Reversible computing is a study that investigates the problem of how computing is effectively
performed in a reversible world. Since physical reversibility is one of the fundamental …

Using a result of Kari and Ollinger, we prove that the torsion problem for elements of the Brin-
Thompson group $2 V $ is undecidable. As a result, we show that there does not exist an …

We give two families of examples of automorphisms of subshifts that are range-distorted, that
is, the radius of their iterations grows sublinearly. One of these families comes from one …

We introduce a new model of cellular automaton called a one-dimensional number-
conserving partitioned cellular automaton (NC-PCA). An NC-PCA is a system such that a …

A number-conserving reversible cellular automaton (NC-RCA) is a computing model that
reflects both reversibility and mass or energy conservation law in physics. We show that …