A class of recursive permutations which is primitive recursive complete
From MaRDI portal
Recommendations
- Composability of permutation classes
- An algorithm for deciding the finiteness of the number of simple permutations in permutation classes
- Combinatorial specification of permutation classes
- Infinite classes of generalised complete permutations
- A recursive construction of t-wise uniform permutations
- An algorithm computing combinatorial specifications of permutation classes
- Recursively-generated permutations of a binary space
- Publication:3491532
- Several classes of complete permutation polynomials
- scientific article; zbMATH DE number 1421075
Cites work
- scientific article; zbMATH DE number 3944108 (Why is no real title available?)
- 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 1754652 (Why is no real title available?)
- scientific article; zbMATH DE number 3247155 (Why is no real title available?)
- scientific article; zbMATH DE number 3291134 (Why is no real title available?)
- scientific article; zbMATH DE number 3305030 (Why is no real title available?)
- scientific article; zbMATH DE number 3315195 (Why is no real title available?)
- scientific article; zbMATH DE number 3056889 (Why is no real title available?)
- A certified study of a reversible programming language
- A class of reversible primitive recursive functions
- AN ELEMENTARY THEORY OF THE CATEGORY OF SETS
- Classical recursion theory. The theory of functions and sets of natural numbers
- Computability and models. Perspectives east and west
- Diagram rewriting and operads
- General Recursive Functions
- Generation of invertible functions
- Higher-dimensional word problems with applications to equational logic
- Information effects
- Interactions between computer science and biology
- Linear programs in a simple reversible language.
- Logical Reversibility of Computation
- Mathematics of Program Construction
- On primitive recursive permutations and their inverses
- On quantum lambda calculi: a foundational perspective
- On reversible Turing machines and their function universality
- On the representation of partial recursive functions as superpositions
- Representation of partial recursive functions with certain conditions in the form of superpositions
- Reversibility and adiabatic computation: trading time and space for energy
- Reversible Turing Machines and Polynomial Time Reversibly Computable Functions
- Reversible computing and cellular automata -- a survey
- Ricercar: a language for describing and rewriting reversible circuits with ancillae and its permutation semantics
- The pillars of computation theory. State, encoding, nondeterminism
- Time/Space Trade-Offs for Reversible Computation
- Towards a reversible functional language
- Towards an algebraic theory of Boolean circuits.
- What do reversible programs compute?
Cited in
(8)- Quantum programming made easy
- Towards a taxonomy for reversible computation approaches
- Certifying expressive power and algorithms of reversible primitive permutations with \textsf{Lean}
- A class of reversible primitive recursive functions
- Splitting Recursion Schemes into Reversible and Classical Interacting Threads
- Algorithmically expressive, always-terminating model for reversible computation
- A Curry-Howard correspondence for linear, reversible computation
- Certifying algorithms and relevant properties of reversible primitive permutations with \textsf{Lean}
This page was built for publication: A class of recursive permutations which is primitive recursive complete
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1989331)
