A class of recursive permutations which is primitive recursive complete (Q1989331): Difference between revisions
From MaRDI portal
Added link to MaRDI item. |
Changed an Item |
||
| Property / describes a project that uses | |||
| Property / describes a project that uses: Theseus / rank | |||
Normal rank | |||
Revision as of 00:27, 1 March 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
