A class of recursive permutations which is primitive recursive complete (Q1989331)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: A class of recursive permutations which is primitive recursive complete |
scientific article; zbMATH DE number 7191316
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A class of recursive permutations which is primitive recursive complete |
scientific article; zbMATH DE number 7191316 |
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
0 references
0.8554569
0 references
0.85441625
0 references
0.8543648
0 references
0.85413915
0 references
0.85387444
0 references
0.85001427
0 references
0 references
