scientific article; zbMATH DE number 3305030
From MaRDI portal
Publication:5586334
zbMath0192.06901MaRDI QIDQ5586334
Publication date: 1963
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items
Reversibility in the higher-order \(\pi\)-calculus ⋮ The complexity of reversible cellular automata ⋮ On reversible Turing machines and their function universality ⋮ Linear programs in a simple reversible language. ⋮ Abelian Invertible Automata ⋮ Simulation and Intrinsic Universality Among Reversible Cellular Automata, the Partition Cellular Automata Leverage ⋮ Reversible Two-Party Computations ⋮ Undecidable event detection problems for ODEs of dimension one and two ⋮ Reversibility of computations in graph-walking automata ⋮ Unnamed Item ⋮ Reversible computing and cellular automata -- a survey ⋮ A class of recursive permutations which is primitive recursive complete ⋮ Quantum circuit oracles for abstract machine computations ⋮ Periodicity and Immortality in Reversible Computing ⋮ Reversible pushdown transducers ⋮ A class of reversible primitive recursive functions ⋮ An instruction set for reversible Turing machines ⋮ Transducing reversibly with finite state machines ⋮ Real-Time Methods in Reversible Computation ⋮ Reductions and functors from problems to word problems ⋮ Reversible space equals deterministic space ⋮ On some variants of Post's correspondence problem
