Reversify any sequential algorithm

DOI10.1007/978-3-031-86319-6_22MaRDI QIDQ7236649zbMATH OpenFDO

Authors Yuri Gurevich

Publication date 29 April 2026

Full work available at URL https://doi.org/10.1007/978-3-031-86319-6_22

Mathematics Subject Classification ID

Combinatorics (05-XX) Mathematical logic and foundations (03-XX) Computer science (68-XX)

Cites work

• scientific article; zbMATH DE number 437525 (Why is no real title available?)
• scientific article; zbMATH DE number 3740740 (Why is no real title available?)
• scientific article; zbMATH DE number 3784244 (Why is no real title available?)
• scientific article; zbMATH DE number 515739 (Why is no real title available?)
• Abstract State Machines
• Abstract state machines capture parallel algorithms
• Conservative logic
• Evolving Algebras 1993: Lipari Guide
• Interactive Small-Step Algorithms I: Axiomatization
• Logical Reversibility of Computation
• Reversible Computing
• Sequential abstract-state machines capture sequential algorithms
• Theory of reversible computing

This page was built for publication: Reversify any sequential algorithm

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7236649)