How Can We Construct Reversible Turing Machines in a Very Simple Reversible Cellular Automaton?

DOI10.1007/978-3-030-79837-6_1OpenAlexW3175571216MaRDI QIDQ5162597

Kenichi Morita

Publication date: 3 November 2021

Published in: Reversible Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-030-79837-6_1

zbMATH Keywords

reversible cellular automatonreversible Turing machineelementary triangular partitioned cellular automatonreversible logic element with memory

Mathematics Subject Classification ID

Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Quantum computation (81P68) Other nonclassical models of computation (68Q09)

Related Items (1)

Gliders in the game of life and in a reversible cellular automaton

Cites Work

• Unnamed Item
• Unnamed Item
• Conservative logic
• Reversibility and surjectivity problems of cellular automata
• 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
• An Asynchronous Cellular Automaton Implementing 2-State 2-Input 2-Output Reversed-Twin Reversible Elements
• Logical Reversibility of Computation
• A universal non-conservative reversible elementary triangular partitioned cellular automaton that shows complex behavior

This page was built for publication: How Can We Construct Reversible Turing Machines in a Very Simple Reversible Cellular Automaton?