Polynomial clone reducibility (Q2436621): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
(One intermediate revision by one other user not shown)
Property / OpenAlex ID
 
Property / OpenAlex ID: W2015974438 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3728961 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Reducibility by Zhegalkin-linear tables / rank
 
Normal rank
Property / cites work
 
Property / cites work: Comparison of linear reducibility with other reducibilities of tabular type / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithmic Randomness and Complexity / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4255465 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Semirecursive Sets and Positive Reducibility / rank
 
Normal rank
Property / cites work
 
Property / cites work: Some Notions of Reducibility and Productiveness / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Kolmogorov-Loveland stochastic sequences are not closed under selecting subsequences / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3611832 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Classical recursion theory. The theory of functions and sets of natural numbers / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4934278 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Two-Valued Iterative Systems of Mathematical Logic. (AM-5) / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5284998 / rank
 
Normal rank

Latest revision as of 09:14, 7 July 2024

scientific article
Language Label Description Also known as
English
Polynomial clone reducibility
scientific article

    Statements

    Polynomial clone reducibility (English)
    0 references
    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
    0 references
    computability
    0 references
    algorithmic randomness
    0 references
    Turing reducibility
    0 references
    polynomial clones
    0 references

    Identifiers