Random non-cupping revisited (Q864434): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
 
(2 intermediate revisions by 2 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/j.jco.2006.03.007 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2069868537 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithmic Randomness and Complexity / rank
 
Normal rank
Property / cites work
 
Property / cites work: Lowness for the class of random sets / rank
 
Normal rank
Property / cites work
 
Property / cites work: The weak truth table degrees of recursively enumerable sets / 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: Non-cupping and randomness / rank
 
Normal rank
Property / cites work
 
Property / cites work: Decidability of the “almost all” theory of degrees / rank
 
Normal rank

Latest revision as of 13:51, 25 June 2024

scientific article
Language Label Description Also known as
English
Random non-cupping revisited
scientific article

    Statements

    Random non-cupping revisited (English)
    0 references
    0 references
    8 February 2007
    0 references
    0 references
    algorithmic randomness
    0 references
    random reals
    0 references
    Turing degrees
    0 references
    strong random anticupping property
    0 references
    anticupping witness
    0 references
    0 references