scientific article; zbMATH DE number 3305030
From MaRDI portal
Publication:5586334
Cited in
(25)- Linear programs in a simple reversible language.
- Reductions and functors from problems to word problems
- Reversible space equals deterministic space
- The complexity of reversible cellular automata
- A class of recursive permutations which is primitive recursive complete
- An instruction set for reversible Turing machines
- Reversibility of computations in graph-walking automata
- Reversibility in the higher-order \(\pi\)-calculus
- Real-time methods in reversible computation
- On reversible Turing machines and their function universality
- Periodicity and Immortality in Reversible Computing
- Undecidable event detection problems for ODEs of dimension one and two
- Abelian Invertible Automata
- Simulation and intrinsic universality among reversible cellular automata, the partition cellular automata leverage
- Reversible pushdown transducers
- Transducing reversibly with finite state machines
- Reversible computations of one-way counter automata
- Reversible Two-Party Computations
- The complexity of iterated reversible computation
- Compositional reversible computation
- A categorical approach to reversible Turing machines and Brin-Thompson groups
- A class of reversible primitive recursive functions
- On some variants of Post's correspondence problem
- Reversible computing and cellular automata -- a survey
- Quantum circuit oracles for abstract machine computations
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5586334)
