Periodicity and Immortality in Reversible Computing
From MaRDI portal
Recommendations
- Reversible and endoreversible computing
- From reversible to irreversible computations
- scientific article; zbMATH DE number 1189113
- A structural approach to reversible computation
- Theory of reversible computing
- Foundations of generalized reversible computing
- Real-time methods in reversible computation
- Applying reversibility theory for the performance evaluation of reversible computations
- An axiomatic approach to reversible computation
- Time/Space Trade-Offs for Reversible Computation
Cites work
- scientific article; zbMATH DE number 3305030 (Why is no real title available?)
- scientific article; zbMATH DE number 3310089 (Why is no real title available?)
- Irreversibility and Heat Generation in the Computing Process
- Logical Reversibility of Computation
- On the presence of periodic configurations in Turing machines and in counter machines.
- On topological dynamics of Turing machines
- The undecidability of the Turing machine immortality problem
- Theory of cellular automata: a survey
- Universality of a reversible two-counter machine
Cited in
(40)- Automata on the plane vs particles and collisions
- An automaton group with undecidable order and Engel problems
- On aperiodic reversible Turing machines (invited talk)
- Permutive one-way cellular automata and the finiteness problem for automaton groups
- Undecidability of the speed positiveness problem in reversible and complete Turing machines
- Reversibility of number-conserving 1D cellular automata: unlocking insights into the dynamics for larger state sets
- On the conjugacy problem of cellular automata
- Topological mixing notions on Turing machine dynamical systems
- A physically universal Turing machine
- Decidability and undecidability in cellular automata
- On immortal configurations in Turing machines
- The transitivity problem of Turing machines
- Some undecidability results for asynchronous transducers and the Brin-Thompson group 2V
- ON THE STRENGTH OF TWO RECURRENCE THEOREMS
- The group of reversible Turing machines
- A small minimal aperiodic reversible Turing machine
- Undecidability of the Surjectivity of the Subshift Associated to a Turing Machine
- The periodic domino problem revisited
- On time-symmetry in cellular automata
- About the domino problem for subshifts on groups
- Automaton (semi)groups: Wang tilings and Schreier tries
- A note on subgroups of automorphism groups of full shifts
- Decidability in Group Shifts and Group Cellular Automata
- Universal groups of cellular automata
- The undecidability of the domino problem
- Computational complexity of finite asynchronous cellular automata
- Transitive action on finite points of a full shift and a finitary Ryan’s theorem
- The finiteness problem for automaton semigroups is undecidable.
- A universal cellular automaton without sensitive subsystems
- Freezing, bounded-change and convergent cellular automata
- On relations between properties in transitive Turing machines
- Constructive Many-one Reduction from the Halting Problem to Semi-unification (Extended Version)
- Undecidability of the topological entropy of reversible cellular automata and related problems
- Effective Projections on Group Shifts to Decide Properties of Group Cellular Automata
- Homotopy theory of monoid actions via group actions and an Elmendorf style theorem
- An exploration of reversible septenary number-conserving cellular automata: a survey of known methods
- Undecidability of semi-unification on a napkin
- The group of reversible Turing machines: subgroups, generators, and computability
- Distortion element in the automorphism group of a full shift
- A categorical approach to reversible Turing machines and Brin-Thompson groups
This page was built for publication: Periodicity and Immortality in Reversible Computing
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3599146)
