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

DOI10.1007/978-3-319-08123-6_23MaRDI QIDQ2945544zbMATH OpenOpenAlexFDO

Authors 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

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

Recommendations

• Design of 1-tape 2-symbol reversible Turing machines based on reversible logic elements
• Constructing reversible Turing machines by reversible logic element with memory
• Reversible and irreversible computations of deterministic finite-state devices
• General design of reversible sequential machines based on reversible logic elements
• scientific article; zbMATH DE number 2050943
• scientific article; zbMATH DE number 1738656
• A hierarchy of fast reversible Turing machines
• An instruction set for reversible Turing machines
• A simple and efficient universal reversible Turing machine
• Verified compilation of space-efficient reversible circuits

Cited in

(10)

• An instruction set for reversible Turing machines
• Gliders in the game of life and in a reversible cellular automaton
• General design of reversible sequential machines based on reversible logic elements
• How can we construct reversible machines out of reversible logic element with memory?
• Constructing reversible Turing machines by reversible logic element with memory
• Constructing reversible Turing machines in a reversible and conservative elementary triangular cellular automaton
• How Can We Construct Reversible Turing Machines in a Very Simple Reversible Cellular Automaton?
• Novel Reversible Logic Elements for Unconventional Computing
• A universal non-conservative reversible elementary triangular partitioned cellular automaton that shows complex behavior
• Design of 1-tape 2-symbol reversible Turing machines based on reversible logic elements

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2945544)