𝐾-trivial degrees and the jump-traceability hierarchy (Q3629434): Difference between revisions

From MaRDI portal
RedirectionBot (talk | contribs)
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
 
(One intermediate revision by one other user not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / cites work
 
Property / cites work: Randomness, lowness and degrees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Strong jump-traceability. I: The computably enumerable case / rank
 
Normal rank
Property / cites work
 
Property / cites work: Strong jump-traceability. II: \(K\)-triviality / rank
 
Normal rank
Property / cites work
 
Property / cites work: Lowness properties and approximations of the jump / rank
 
Normal rank
Property / cites work
 
Property / cites work: Low for random reals and positive-measure domination / rank
 
Normal rank
Property / cites work
 
Property / cites work: Lowness for the Class of Schnorr Random Reals / rank
 
Normal rank
Property / cites work
 
Property / cites work: Randomness and Computability: Open Questions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5494235 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Lowness properties and randomness / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3530400 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3611832 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Beyond strong jump traceability / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computational randomness and lowness / rank
 
Normal rank

Latest revision as of 15:00, 1 July 2024

scientific article
Language Label Description Also known as
English
𝐾-trivial degrees and the jump-traceability hierarchy
scientific article

    Statements

    𝐾-trivial degrees and the jump-traceability hierarchy (English)
    0 references
    0 references
    0 references
    0 references
    27 May 2009
    0 references
    \(K\)-triviality
    0 references
    Turing degrees
    0 references
    jump traceability
    0 references
    superlinear orders
    0 references

    Identifiers