How can we construct reversible machines out of reversible logic element with memory?

DOI10.1007/978-3-319-13350-8_26zbMATH Open1323.68275OpenAlexW210027908MaRDI QIDQ2944902FDOQ2944902

Authors: Tsuyoshi Ogiro, Kenichi Morita 

Publication date: 8 September 2015

Published in: Computing with New Resources (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-319-13350-8_26

Recommendations

• scientific article; zbMATH DE number 7357506
• Constructing reversible Turing machines by reversible logic element with memory
• Compact Realization of Reversible Turing Machines by 2-State Reversible Logic Elements
• scientific article; zbMATH DE number 2050943
• General design of reversible sequential machines based on reversible logic elements

Mathematics Subject Classification ID

Mathematical problems of computer architecture (68M07)

Cites Work

• Conservative logic
• Logical Reversibility of Computation
• Reversible computing and cellular automata -- a survey
• Bicontinuous extensions of invertible combinatorial functions
• Title not available (Why is that?)
• Towards a Theory of Universal Speed-Independent Modules
• Computation and construction universality of reversible cellular automata
• An Asynchronous Cellular Automaton Implementing 2-State 2-Input 2-Output Reversed-Twin Reversible Elements
• Title not available (Why is that?)
• Universal asynchronous iterative arrays of Mealy automata
• Title not available (Why is that?)
• Machines, Computations, and Universality
• Compact Realization of Reversible Turing Machines by 2-State Reversible Logic Elements
• Title not available (Why is that?)

Cited In (2)

• Title not available (Why is that?)
• Design of 1-tape 2-symbol reversible Turing machines based on reversible logic elements

This page was built for publication: How can we construct reversible machines out of reversible logic element with memory?

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