Polynomial clone reducibility (Q2436621)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 6261653
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Polynomial clone reducibility |
scientific article; zbMATH DE number 6261653 |
Statements
Polynomial clone reducibility (English)
0 references
25 February 2014
0 references
In the paper under review, the author investigates randomness under polynomial clone reducibilities. The major result states that if \(x\) is Kurtz random and \(C_1\subseteq C_2\) are polynomial clones, then there is a \(y\) that is \(C_1\)-reducible to \(x\) but not \(C_2\).
0 references
computability
0 references
algorithmic randomness
0 references
Turing reducibility
0 references
polynomial clones
0 references
0 references
0.7403914332389832
0 references
0.7347878217697144
0 references
0.7314782738685608
0 references
0.7261717915534973
0 references
