Design of 1-tape 2-symbol reversible Turing machines based on reversible logic elements

DOI10.1016/j.tcs.2012.07.027zbMath1279.68081OpenAlexW2004915522MaRDI QIDQ690483

Kenichi Morita, Rui-Long Yang, Jia Lee

Publication date: 27 November 2012

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.tcs.2012.07.027

zbMATH Keywords

reversibilityreversible Turing machineasynchronous operationreversible logic element

Mathematics Subject Classification ID

Related Items

Universal logic elements constructed on the Turing tumble ⋮ Invertible Construction of Decimal-to-Binary Converter Using Reversible Elements ⋮ Emergence of universal global behavior from reversible local transitions in asynchronous systems ⋮ General design of reversible sequential machines based on reversible logic elements ⋮ Binary-decision-diagram-based decomposition of Boolean functions into reversible logic elements

Cites Work

• Fluctuation-driven computing on number-conserving cellular automata
• Reversible computing and cellular automata -- a survey
• Conservative logic
• Time and space bounds for reversible simulation
• Efficient Turing-Universal Computation with DNA Polymers
• An Asynchronous Cellular Automaton Implementing 2-State 2-Input 2-Output Reversed-Twin Reversible Elements
• Logical Reversibility of Computation
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item