Pages that link to "Item:Q3599146"
From MaRDI portal
The following pages link to Periodicity and Immortality in Reversible Computing (Q3599146):
Displayed 21 items.
- A small minimal aperiodic reversible Turing machine (Q340590) (← links)
- The periodic domino problem revisited (Q410732) (← links)
- On time-symmetry in cellular automata (Q439976) (← links)
- Computational complexity of finite asynchronous cellular automata (Q517039) (← links)
- Automata on the plane vs particles and collisions (Q1029350) (← links)
- An automaton group with undecidable order and Engel problems (Q1693094) (← links)
- Permutive one-way cellular automata and the finiteness problem for automaton groups (Q2011658) (← links)
- Undecidability of the speed positiveness problem in reversible and complete Turing machines (Q2040026) (← links)
- On the conjugacy problem of cellular automata (Q2201790) (← links)
- Decidability and undecidability in cellular automata (Q2869780) (← links)
- The Transitivity Problem of Turing Machines (Q2946339) (← links)
- Some undecidability results for asynchronous transducers and the Brin-Thompson group $2V$ (Q2960427) (← links)
- The Group of Reversible Turing Machines (Q3186472) (← links)
- Undecidability of the Surjectivity of the Subshift Associated to a Turing Machine (Q3453734) (← links)
- About the Domino Problem for Subshifts on Groups (Q4613553) (← links)
- Automaton (Semi)groups: Wang Tilings and Schreier Tries (Q4613554) (← links)
- A note on subgroups of automorphism groups of full shifts (Q4643296) (← links)
- The Undecidability of the Domino Problem (Q5141335) (← links)
- Transitive action on finite points of a full shift and a finitary Ryan’s theorem (Q5376550) (← links)
- THE FINITENESS PROBLEM FOR AUTOMATON SEMIGROUPS IS UNDECIDABLE (Q5410736) (← links)
- A Universal Cellular Automaton Without Sensitive Subsystems (Q5501612) (← links)