Design of 1-tape 2-symbol reversible Turing machines based on reversible logic elements
type: Item
instance of: scholarly article
title: Design of 1-tape 2-symbol reversible Turing machines based on reversible logic elements
zbMATH Open document ID: 1279.68081
author: Jia Lee
author: Rui-Long Yang
author: Kenichi Morita
published in: Theoretical Computer Science
publication date: 2012-11-27T00:00:00Z
Mathematics Subject Classification ID: 68Q05
zbMATH DE Number: 6110702
zbMATH Keywords: reversible Turing machine
zbMATH Keywords: reversible logic element
zbMATH Keywords: reversibility
zbMATH Keywords: asynchronous operation
MaRDI profile type: Publication
full work available at URL: j.tcs.2012.07.027
OpenAlex ID: W2004915522
cites work: Logical Reversibility of Computation
cites work: Q4673394
cites work: Time and space bounds for reversible simulation
cites work: Q3838825
cites work: Conservative logic
cites work: Q5592246
cites work: An Asynchronous Cellular Automaton Implementing 2-State 2-Input 2-Output Reversed-Twin Reversible Elements
cites work: A simple model of asynchronous cellular automata exploiting fluctuation
cites work: Fluctuation-driven computing on number-conserving cellular automata
cites work: Q3677179
cites work: Q4529993
cites work: Q4544350
cites work: Reversible computing and cellular automata -- a survey
cites work: Efficient Turing-Universal Computation with DNA Polymers
DOI: 10.1016/J.TCS.2012.07.027
description: scientific article; zbMATH DE number 6110702