A class of recursive permutations which is primitive recursive complete (Q1989331): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
Normalize DOI.
 
(5 intermediate revisions by 5 users not shown)
Property / DOI
 
Property / DOI: 10.1016/j.tcs.2019.11.029 / rank
Normal rank
 
Property / describes a project that uses
 
Property / describes a project that uses: Theseus / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2990494648 / rank
 
Normal rank
Property / Wikidata QID
 
Property / Wikidata QID: Q126641588 / rank
 
Normal rank
Property / cites work
 
Property / cites work: What Do Reversible Programs Compute? / rank
 
Normal rank
Property / cites work
 
Property / cites work: On reversible Turing machines and their function universality / rank
 
Normal rank
Property / cites work
 
Property / cites work: Logical Reversibility of Computation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Time/Space Trade-Offs for Reversible Computation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4535080 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3715301 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Higher-dimensional word problems with applications to equational logic / rank
 
Normal rank
Property / cites work
 
Property / cites work: On primitive recursive permutations and their inverses / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3893911 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Interactions between computer science and biology / rank
 
Normal rank
Property / cites work
 
Property / cites work: Generation of invertible functions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Reversible Turing Machines and Polynomial Time Reversibly Computable Functions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Information effects / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3425600 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the representation of partial recursive functions as superpositions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Representation of partial recursive functions with certain conditions in the form of superpositions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5796051 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Towards an algebraic theory of Boolean circuits. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2865985 / rank
 
Normal rank
Property / cites work
 
Property / cites work: AN ELEMENTARY THEORY OF THE CATEGORY OF SETS / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5586334 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Reversibility and adiabatic computation: trading time and space for energy / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5596230 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Linear programs in a simple reversible language. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Reversible computing and cellular automata -- a survey / rank
 
Normal rank
Property / cites work
 
Property / cites work: Mathematics of Program Construction / rank
 
Normal rank
Property / cites work
 
Property / cites work: Classical recursion theory. The theory of functions and sets of natural numbers / rank
 
Normal rank
Property / cites work
 
Property / cites work: A class of reversible primitive recursive functions / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Certified Study of a Reversible Programming Language / rank
 
Normal rank
Property / cites work
 
Property / cites work: General Recursive Functions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5573961 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The pillars of computation theory. State, encoding, nondeterminism / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5533181 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4040892 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Ricercar: A Language for Describing and Rewriting Reversible Circuits with Ancillae and Its Permutation Semantics / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3886867 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Towards a Reversible Functional Language / rank
 
Normal rank
Property / cites work
 
Property / cites work: On quantum lambda calculi: a foundational perspective / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1016/J.TCS.2019.11.029 / rank
 
Normal rank

Latest revision as of 16:45, 16 December 2024

scientific article
Language Label Description Also known as
English
A class of recursive permutations which is primitive recursive complete
scientific article

    Statements

    A class of recursive permutations which is primitive recursive complete (English)
    0 references
    0 references
    0 references
    0 references
    21 April 2020
    0 references
    reversible computation
    0 references
    unconventional computing models
    0 references
    computable permutations
    0 references
    primitive recursive functions
    0 references
    recursion theory
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers