Pages that link to "Item:Q1575918"
From MaRDI portal
The following pages link to A computation-universal two-dimensional 8-state triangular reversible cellular automaton (Q1575918):
Displaying 20 items.
- Emergence of universal global behavior from reversible local transitions in asynchronous systems (Q507745) (← links)
- Simulating reversible Turing machines and cyclic tag systems by one-dimensional reversible cellular automata (Q549699) (← links)
- Reversible computing and cellular automata -- a survey (Q924686) (← links)
- Frontier between decidability and undecidability: A survey (Q1575913) (← links)
- Gliders in the game of life and in a reversible cellular automaton (Q2086701) (← links)
- Reversible elementary triangular partitioned cellular automata and their complex behavior (Q2086737) (← links)
- On fungal automata (Q2086749) (← links)
- Computational universality of fungal sandpile automata (Q2213185) (← links)
- Number-conserving reversible cellular automata and their computation-universality (Q2773021) (← links)
- Computation in reversible cellular automata (Q2869782) (← links)
- An 8-State Simple Reversible Triangular Cellular Automaton that Exhibits Complex Behavior (Q3186483) (← links)
- Universality of 8-State Reversible and Conservative Triangular Partitioned Cellular Automata (Q4571169) (← links)
- (Q4782731) (← links)
- Universality of Reversible Hexagonal Cellular Automata (Q4953340) (← links)
- Surprising Areas in the Quest for Small Universal Devices (Q4982064) (← links)
- (Q5061520) (← links)
- How Can We Construct Reversible Turing Machines in a Very Simple Reversible Cellular Automaton? (Q5162597) (← links)
- A survey of cellular automata: types, dynamics, non-uniformity and applications (Q6151179) (← links)
- A universal non-conservative reversible elementary triangular partitioned cellular automaton that shows complex behavior (Q6191399) (← links)
- The complexity of iterated reversible computation (Q6566596) (← links)
