Constructing reversible Turing machines by reversible logic element with memory

DOI10.1007/978-3-319-09039-9_6MaRDI QIDQ4982993zbMATH OpenOpenAlexFDO

Authors Kenichi Morita

Publication date 14 April 2015

Published in Automata, Universality, Computation (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-319-09039-9_6

Mathematics Subject Classification ID

Recommendations

• Compact Realization of Reversible Turing Machines by 2-State Reversible Logic Elements
• How can we construct reversible machines out of reversible logic element with memory?
• Design of 1-tape 2-symbol reversible Turing machines based on reversible logic elements
• scientific article; zbMATH DE number 7357506
• scientific article; zbMATH DE number 2050943

Cited in

(13)

• An instruction set for reversible Turing machines
• General design of reversible sequential machines based on reversible logic elements
• How can we construct reversible machines out of reversible logic element with memory?
• Compact Realization of Reversible Turing Machines by 2-State Reversible Logic Elements
• scientific article; zbMATH DE number 2050943 (Why is no real title available?)
• scientific article; zbMATH DE number 1738656 (Why is no real title available?)
• scientific article; zbMATH DE number 7357506 (Why is no real title available?)
• Constructing reversible Turing machines in a reversible and conservative elementary triangular cellular automaton
• Invertible construction of decimal-to-binary converter using reversible elements
• Machines, Computations, and Universality
• Novel Reversible Logic Elements for Unconventional Computing
• Making reversible computing machines in a reversible cellular space
• Design of 1-tape 2-symbol reversible Turing machines based on reversible logic elements

This page was built for publication: Constructing reversible Turing machines by reversible logic element with memory

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