The following pages link to Theory of reversible computing (Q1684627):
Displaying 28 items.
- Transactions on Computational Science XXIV. Special issue on reversible computing. (Q492153) (← links)
- Reversible computing and cellular automata -- a survey (Q924686) (← links)
- Foundations of generalized reversible computing (Q1705573) (← links)
- Reversibility and universality. Essays presented to Kenichi Morita on the occasion of his 70th birthday (Q1753984) (← links)
- Reversible and endoreversible computing (Q1909296) (← links)
- Simulating reversible computation with reaction systems (Q1982972) (← links)
- Reversible computation in nature inspired rule-based systems (Q1982978) (← links)
- The fixed point problem of a simple reversible language (Q1989327) (← links)
- An instruction set for reversible Turing machines (Q2041688) (← links)
- Gliders in the game of life and in a reversible cellular automaton (Q2086701) (← links)
- Reversible elementary triangular partitioned cellular automata and their complex behavior (Q2086737) (← links)
- Certifying algorithms and relevant properties of reversible primitive permutations with \textsf{Lean} (Q2097420) (← links)
- Controlled reversibility in communicating reaction systems (Q2152435) (← links)
- A structural approach to reversible computation (Q2581367) (← links)
- Ternary reversible number-conserving cellular automata are trivial (Q2660739) (← links)
- A physically universal Turing machine (Q2678253) (← links)
- Reversible computing from a programming language perspective (Q2693633) (← links)
- Computation, information, and the arrow of time (Q2906561) (← links)
- Reversible Computing (Q3076735) (← links)
- A two-layer representation of four-state reversible number-conserving 2D cellular automata (Q3303371) (← links)
- Periodicity and Immortality in Reversible Computing (Q3599146) (← links)
- (Q5061520) (← links)
- How Can We Construct Reversible Turing Machines in a Very Simple Reversible Cellular Automaton? (Q5162597) (← links)
- A Design-Based Model of Reversible Computation (Q5307475) (← links)
- Looking at Euler flows through a contact mirror: universality and undecidability (Q6064566) (← links)
- Certifying expressive power and algorithms of reversible primitive permutations with \textsf{Lean} (Q6151610) (← links)
- About reversibility in sP colonies and reaction systems (Q6177186) (← links)
- Modelling reliability of reversible circuits with 2D second-order cellular automata (Q6558849) (← links)
