Pages that link to "Item:Q3000598"
From MaRDI portal
The following pages link to What Do Reversible Programs Compute? (Q3000598):
Displaying 16 items.
- On reversible Turing machines and their function universality (Q303695) (← links)
- Join inverse categories and reversible recursion (Q511931) (← links)
- A class of reversible primitive recursive functions (Q737109) (← links)
- Fundamentals of reversible flowchart languages (Q896906) (← links)
- The fixed point problem of a simple reversible language (Q1989327) (← links)
- A class of recursive permutations which is primitive recursive complete (Q1989331) (← links)
- A categorical foundation for structured reversible flowchart languages (Q2130590) (← links)
- Reversible computing from a programming language perspective (Q2693633) (← links)
- Join Inverse Categories as Models of Reversible Recursion (Q2811333) (← links)
- Isomorphic Interpreters from Logically Reversible Abstract Machines (Q3453735) (← links)
- Garbage-Free Reversible Integer Multiplication with Constants of the Form 2 k ±2 l ±1 (Q3453749) (← links)
- A Certified Study of a Reversible Programming Language (Q4580228) (← links)
- A categorical foundation for structured reversible flowchart languages: Soundness and adequacy (Q4585070) (← links)
- Clean Reversible Simulations of Ranking Binary Trees (Q5112174) (← links)
- Small Universal Reversible Counter Machines (Q5112183) (← links)
- (Q5867516) (← links)
