A class of recursive permutations which is primitive recursive complete (Q1989331)

From MaRDI portal
Revision as of 16:45, 16 December 2024 by Import241208061232 (talk | contribs) (Normalize DOI.)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
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