Pages that link to "Item:Q5684240"

The following pages link to Logical Reversibility of Computation (Q5684240):

Displaying 14 items.

• Quantum theory, namely the pure and reversible theory of information (Q406178) (← links)
• Exponentially more concise quantum recognition of non-RMM regular languages (Q473186) (← links)
• Join inverse categories and reversible recursion (Q511931) (← links)
• Automata theory based on quantum logic: Some characterizations (Q598192) (← links)
• Aligning the representation and reality of computation with asynchronous logic automata (Q652552) (← links)
• Reversible simulation of one-dimensional irreversible cellular automata (Q672388) (← links)
• Fundamentals of reversible flowchart languages (Q896906) (← links)
• Improving the quantum cost of reversible Boolean functions using reorder algorithm (Q1654122) (← links)
• One complexity theorist's view of quantum computing (Q1870556) (← links)
• Quantum speed-up for unsupervised learning (Q1945031) (← links)
• Automata theory based on quantum logic: reversibilities and pushdown automata (Q2455592) (← links)
• Determination of equivalence between quantum sequential machines (Q2503273) (← links)
• Efficient Turing-Universal Computation with DNA Polymers (Q3070966) (← links)
• Periodicity and Immortality in Reversible Computing (Q3599146) (← links)