A class of Recursive Permutations which is Primitive Recursive complete
نویسندگان
چکیده
We focus on total functions in the theory of reversible computational models. We define a class of recursive permutations, dubbed Reversible Primitive Permutations (RPP) which are computable invertible total endo-functions on integers, so a subset of total reversible computations. RPP is generated from five basic functions (identity, negation, successor, predecessor, swap), two notions of composition (sequential and parallel), one functional iteration and one functional selection. Also, RPP is closed by inversion, is expressive enough to encode Cantor pairing and the whole class of Primitive Recursive Functions.
منابع مشابه
Primitive recursive functions versus partial recursive functions: comparing the degree of undecidability
Consider a decision problem whose instance is a function. Its degree of undecidability, measured by the corresponding class of the arithmetic (or Kleene-Mostowski) hierarchy hierarchy, may depend on whether the instance is a partial recursive or a primitive recursive function. A similar situation happens for results like Rice Theorem (which is false for primitive recursive functions). Classical...
متن کاملA complete characterization of primitive recursive intensional behaviours
We give a complete characterization of the class of functions that are the intensional behaviours of Primitive Recursive algorithms. This class is the set of primitive recursive functions that have a null basic case of recursion. This result is obtained using the property of ultimate unarity and a geometrical approach of sequential functions on N the set of positive integers. AMS Subject Classi...
متن کاملA recursive construction of a class of finite normalized tight frames
Finite normalized tight frames are interesting because they provide decompositions in applications and some physical interpretations. In this article, we give a recursive method for constructing them.
متن کاملSubclasses of the Separable Permutations
The separable permutations are those that can be obtained from the trivial permutation by two operations called direct sum and skew sum. This class of permutations contains the class of stack sortable permutations,Avp231q, which are enumerated by the Catalan numbers. We prove that all subclasses of the separable permutations which do not contain Avp231q or a symmetry of this class have rational...
متن کاملPattern avoidance is not P-recursive
Let F ⊂ Sk be a nite set of permutations and let Cn(F) denote the number of permutations σ ∈ Sn avoiding the set of patterns F . The Noonan Zeilberger conjecture states that the sequence {Cn(F)} is P-recursive. We disprove this conjecture. The proof uses Computability Theory and builds on our earlier work [GP1]. We also give two applications of our approach to complexity of computing {Cn(F)}.
متن کامل