A class of recursive permutations which is primitive recursive complete
type: Item
instance of: scholarly article
title: A class of recursive permutations which is primitive recursive complete
zbMATH Open document ID: 1481.03031
author: Luca Paolini
author: Mauro Piccolo
author: Luca Roversi
published in: Theoretical Computer Science
publication date: 2020-04-21T00:00:00Z
full work available at URL: http://hdl.handle.net/2318/1734163
Mathematics Subject Classification ID: 03D20
Mathematics Subject Classification ID: 68Q09
zbMATH DE Number: 7191316
zbMATH Keywords: reversible computation
zbMATH Keywords: unconventional computing models
zbMATH Keywords: computable permutations
zbMATH Keywords: primitive recursive functions
zbMATH Keywords: recursion theory
describes a project that uses: Theseus
MaRDI profile type: Publication
OpenAlex ID: W2990494648
Wikidata QID: Q126641588
cites work: What Do Reversible Programs Compute?
cites work: On reversible Turing machines and their function universality
cites work: Logical Reversibility of Computation
cites work: Time/Space Trade-Offs for Reversible Computation
cites work: Q4535080
cites work: Q3715301
cites work: Higher-dimensional word problems with applications to equational logic
cites work: On primitive recursive permutations and their inverses
cites work: Q3893911
cites work: Interactions between computer science and biology
cites work: Generation of invertible functions
cites work: Reversible Turing Machines and Polynomial Time Reversibly Computable Functions
cites work: Information effects
cites work: Q3425600
cites work: On the representation of partial recursive functions as superpositions
cites work: Representation of partial recursive functions with certain conditions in the form of superpositions
cites work: Q5796051
cites work: Towards an algebraic theory of Boolean circuits.
cites work: Diagram rewriting and operads
cites work: AN ELEMENTARY THEORY OF THE CATEGORY OF SETS
cites work: Q5586334
cites work: Reversibility and adiabatic computation: trading time and space for energy
cites work: Q5596230
cites work: Linear programs in a simple reversible language.
cites work: Reversible computing and cellular automata -- a survey
cites work: Mathematics of Program Construction
cites work: Classical recursion theory. The theory of functions and sets of natural numbers
cites work: A class of reversible primitive recursive functions
cites work: A Certified Study of a Reversible Programming Language
cites work: General Recursive Functions
cites work: Q5573961
cites work: The pillars of computation theory. State, encoding, nondeterminism
cites work: Q5533181
cites work: Q4040892
cites work: Ricercar: A Language for Describing and Rewriting Reversible Circuits with Ancillae and Its Permutation Semantics
cites work: Q3886867
cites work: Towards a Reversible Functional Language
cites work: On quantum lambda calculi: a foundational perspective
DOI: 10.1016/J.TCS.2019.11.029
Recommended article: Composability of permutation classes
Recommended article: An algorithm for deciding the finiteness of the number of simple permutations in permutation classes
Recommended article: Combinatorial specification of permutation classes
Recommended article: Infinite classes of generalised complete permutations
Recommended article: A recursive construction of t -wise uniform permutations
Recommended article: An algorithm computing combinatorial specifications of permutation classes
Recommended article: Рекурсивно-порождаемые перестановки двоичного пространства
Recommended article: Q3491532
Recommended article: Several classes of complete permutation polynomials
Recommended article: Q4946101
description: scientific article; zbMATH DE number 7191316