A class of reversible primitive recursive functions

DOI10.1016/j.entcs.2016.03.016zbMath1345.03078OpenAlexW2314307518WikidataQ57722143 ScholiaQ57722143MaRDI QIDQ737109

Luca Roversi, Luca Paolini, Mauro Piccolo

Publication date: 5 August 2016

Full work available at URL: https://doi.org/10.1016/j.entcs.2016.03.016

zbMATH Keywords

reversible computingprimitive recursive functionsrecursive permutations

Mathematics Subject Classification ID

Recursive functions and relations, subrecursive hierarchies (03D20)

Related Items (7)

A type-assignment of linear erasure and duplication ⋮ Unnamed Item ⋮ $$\mathsf {qPCF}$$ : A Language for Quantum Circuit Computations ⋮ The fixed point problem of a simple reversible language ⋮ A class of recursive permutations which is primitive recursive complete ⋮ A Certified Study of a Reversible Programming Language ⋮ QPCF: higher-order languages and quantum circuits

Cites Work

• Generation of invertible functions
• Classical recursion theory. The theory of functions and sets of natural numbers
• Linear programs in a simple reversible language.
• What Do Reversible Programs Compute?
• Reversible Turing Machines and Polynomial Time Reversibly Computable Functions
• Irreversibility and Heat Generation in the Computing Process
• Logical Reversibility of Computation
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: A class of reversible primitive recursive functions