A class of recursive permutations which is primitive recursive complete (Q1989331): Difference between revisions
From MaRDI portal
ReferenceBot (talk | contribs) Changed an Item |
Normalize DOI. |
||
| Property / DOI | |||
| Property / DOI: 10.1016/j.tcs.2019.11.029 / 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
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
