On a Class of Reversible Primitive Recursive Functions and Its Turing-Complete Extensions

Abstract

Reversible computing is both forward and backward deterministic. This means that a uniquely determined step exists from the previous computational conguration (backward determinism) to the next one (forward determinism) and vice-versa. We present the Reversible Primitive Recursive Functions (RPRF), a class of reversible (endo-)functions over natural numbers which allows to capture interesting extensional aspects of reversible computation in a formalism quite close to that of classical Primitive Recursive Functions. The class RPRF can express bijections over integers (not only natural numbers), is expressive enough to admit an embedding of the Primitive Recursive Functions and, of course, its evaluation is eective. We also extend RPRF to obtain a new class of functions which are eective and Turing-complete, and represent all Kleene's µ-recursive functions. Finally, we consider reversible recursion schemes that lead outside the reversible endo-functions.

QPCF: Higher-Order Languages and Quantum Circuits

“…For instance, all reversible circuits are a subset of quantum ones. See [44,45] for a recent characterization of the reversible computing. In particular, qPCF appears to be a simple setting where reversible and classical computation coexists and, potentially, can cooperate.…”

Quantum Programming Made Easy

“…The goal is to further ease the embedding of quantum programming in traditional programming frameworks. Fourth, we are interested in developing a denotational semantics for IQu, maybe a not complete one, but suitable to tackle the equivalence between programs involving (meaningful) quantum, non-deterministic [2,3], probabilistic and reversible [20,21] aspects [4].…”

A class of Recursive Permutations which is Primitive Recursive complete

“…Toffoli's works on reversible boolean circuits influenced our choice. However, in [39] we extend a reversible language with a bijective built-in map from Z × Z to Z such that 0, 0 → 0. Clearly, the input/output symmetry breaks up and we move from permutations to isomorphisms.…”