scientific article; zbMATH DE number 7488329

MaRDI QIDQ5061520

Kenichi Morita

Publication date: 11 March 2022

Full work available at URL: http://www.jalc.de/issues/2021/issue_26_1-2/jalc-2021-125-144.php

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

universalityreversible computingreversible Turing machineelementary triangular partitioned cellular automatonreversible logic element with memory

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

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

Uses Software

• Golly

Cites Work

• Unnamed Item
• Unnamed Item
• Conservative logic
• A computation-universal two-dimensional 8-state triangular reversible cellular automaton
• Theory of reversible computing
• Compact Realization of Reversible Turing Machines by 2-State Reversible Logic Elements
• Universality of 8-State Reversible and Conservative Triangular Partitioned Cellular Automata
• Logical Reversibility of Computation

This page was built for publication: