A universal non-conservative reversible elementary triangular partitioned cellular automaton that shows complex behavior

DOI10.1007/s11047-017-9655-9zbMath1530.68183OpenAlexW2767836001MaRDI QIDQ6191399

Kenichi Morita

Publication date: 9 February 2024

Published in: Natural Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s11047-017-9655-9

zbMATH Keywords

reversible cellular automatoncomputational universalitygliderelementary triangular partitioned cellular automatonreversible logic gate

Mathematics Subject Classification ID

Cellular automata (computational aspects) (68Q80)

Related Items (2)

How Can We Construct Reversible Turing Machines in a Very Simple Reversible Cellular Automaton? ⋮ Gliders in the game of life and in a reversible cellular automaton

Cites Work

• Conservative logic
• A computation-universal two-dimensional 8-state triangular reversible cellular automaton
• Simulations between cellular automata on Cayley graphs
• Compact Realization of Reversible Turing Machines by 2-State Reversible Logic Elements
• Universality of 8-State Reversible and Conservative Triangular Partitioned Cellular Automata
• UNIVERSAL CELLULAR AUTOMATON OVER A HEXAGONAL TILING WITH 3 STATES
• Logical Reversibility of Computation
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: A universal non-conservative reversible elementary triangular partitioned cellular automaton that shows complex behavior