A class of reversible primitive recursive functions
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 3692653 (Why is no real title available?)
- scientific article; zbMATH DE number 3700811 (Why is no real title available?)
- scientific article; zbMATH DE number 194103 (Why is no real title available?)
- scientific article; zbMATH DE number 3305030 (Why is no real title available?)
- scientific article; zbMATH DE number 3056889 (Why is no real title available?)
- scientific article; zbMATH DE number 3073037 (Why is no real title available?)
- Classical recursion theory. The theory of functions and sets of natural numbers
- Generation of invertible functions
- Irreversibility and Heat Generation in the Computing Process
- Linear programs in a simple reversible language.
- Logical Reversibility of Computation
- Reversible Turing Machines and Polynomial Time Reversibly Computable Functions
- What do reversible programs compute?
Cited in
(11)- Quantum programming made easy
- scientific article; zbMATH DE number 23837 (Why is no real title available?)
- A class of recursive permutations which is primitive recursive complete
- The fixed point problem of a simple reversible language
- Reversible Functional Array Programming
- What do reversible programs compute?
- QPCF: higher-order languages and quantum circuits
- \textsc{qPCF}: a language for quantum circuit computations
- A certified study of a reversible programming language
- A type-assignment of linear erasure and duplication
- scientific article; zbMATH DE number 6691416 (Why is no real title available?)
This page was built for publication: A class of reversible primitive recursive functions
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q737109)