Compact Realization of Reversible Turing Machines by 2-State Reversible Logic Elements

DOI10.1007/978-3-319-08123-6_23zbMath1445.68099OpenAlexW76408293MaRDI QIDQ2945544

Rei Suyama, Kenichi Morita

Publication date: 14 September 2015

Published in: Unconventional Computation and Natural Computation (Search for Journal in Brave)

Full work available at URL: http://ir.lib.hiroshima-u.ac.jp/files/public/3/36076/20141016211331458506/Morita_UCNC2014.pdf

Mathematics Subject Classification ID

Other nonclassical models of computation (68Q09) Networks and circuits as models of computation; circuit complexity (68Q06)

Related Items (6)

How Can We Construct Reversible Machines Out of Reversible Logic Element with Memory? ⋮ A universal non-conservative reversible elementary triangular partitioned cellular automaton that shows complex behavior ⋮ How Can We Construct Reversible Turing Machines in a Very Simple Reversible Cellular Automaton? ⋮ Unnamed Item ⋮ An instruction set for reversible Turing machines ⋮ Gliders in the game of life and in a reversible cellular automaton

This page was built for publication: Compact Realization of Reversible Turing Machines by 2-State Reversible Logic Elements