How Can We Construct Reversible Machines Out of Reversible Logic Element with Memory?

DOI10.1007/978-3-319-13350-8_26zbMath1323.68275OpenAlexW210027908MaRDI QIDQ2944902

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

Mathematics Subject Classification ID

Mathematical problems of computer architecture (68M07)

Cites Work

• Universal asynchronous iterative arrays of Mealy automata
• Reversible computing and cellular automata -- a survey
• Conservative logic
• Computation and construction universality of reversible cellular automata
• 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
• Bicontinuous extensions of invertible combinatorial functions
• Towards a Theory of Universal Speed-Independent Modules
• Logical Reversibility of Computation
• Machines, Computations, and Universality
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item