The following pages link to (Q5586334):
Displaying 23 items.
- Reversibility in the higher-order \(\pi\)-calculus (Q264996) (← links)
- On reversible Turing machines and their function universality (Q303695) (← links)
- A class of reversible primitive recursive functions (Q737109) (← links)
- On some variants of Post's correspondence problem (Q792770) (← links)
- Reversible computing and cellular automata -- a survey (Q924686) (← links)
- Quantum circuit oracles for abstract machine computations (Q960862) (← links)
- Linear programs in a simple reversible language. (Q1401215) (← links)
- Reductions and functors from problems to word problems (Q1566706) (← links)
- Reversible space equals deterministic space (Q1567403) (← links)
- The complexity of reversible cellular automata (Q1884853) (← links)
- A class of recursive permutations which is primitive recursive complete (Q1989331) (← links)
- An instruction set for reversible Turing machines (Q2041688) (← links)
- Reversibility of computations in graph-walking automata (Q2216129) (← links)
- Real-Time Methods in Reversible Computation (Q2822490) (← links)
- Periodicity and Immortality in Reversible Computing (Q3599146) (← links)
- Undecidable event detection problems for ODEs of dimension one and two (Q4348239) (← links)
- Abelian Invertible Automata (Q5112163) (← links)
- Simulation and Intrinsic Universality Among Reversible Cellular Automata, the Partition Cellular Automata Leverage (Q5112164) (← links)
- Reversible pushdown transducers (Q5918384) (← links)
- Transducing reversibly with finite state machines (Q5919580) (← links)
- Reversible Two-Party Computations (Q6204131) (← links)
- The complexity of iterated reversible computation (Q6566596) (← links)
- Compositional reversible computation (Q6637582) (← links)
