DENSITY-1-BOUNDING AND QUASIMINIMALITY IN THE GENERIC DEGREES (Q5359570): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
(2 intermediate revisions by 2 users not shown)
Property / OpenAlex ID
 
Property / OpenAlex ID: W2962978350 / rank
 
Normal rank
Property / arXiv ID
 
Property / arXiv ID: 1512.09057 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Lowness and nullsets / rank
 
Normal rank
Property / cites work
 
Property / cites work: Notions of robust information coding / rank
 
Normal rank
Property / cites work
 
Property / cites work: COARSE REDUCIBILITY AND ALGORITHMIC RANDOMNESS / rank
 
Normal rank
Property / cites work
 
Property / cites work: Asymptotic density and the coarse computability bound / rank
 
Normal rank
Property / cites work
 
Property / cites work: Using random sets as oracles / rank
 
Normal rank
Property / cites work
 
Property / cites work: Nonexistence of minimal pairs for generic computability / rank
 
Normal rank
Property / cites work
 
Property / cites work: THE GENERIC DEGREES OF DENSITY-1 SETS, AND A CHARACTERIZATION OF THE HYPERARITHMETIC REALS / rank
 
Normal rank
Property / cites work
 
Property / cites work: Generic computability, Turing degrees, and asymptotic density / rank
 
Normal rank
Property / cites work
 
Property / cites work: Generic-case complexity, decision problems in group theory, and random walks. / rank
 
Normal rank
Property / cites work
 
Property / cites work: The axiomatization of randomness / rank
 
Normal rank
Property / cites work
 
Property / cites work: Lowness for genericity / rank
 
Normal rank

Latest revision as of 10:12, 14 July 2024

scientific article; zbMATH DE number 6779955
Language Label Description Also known as
English
DENSITY-1-BOUNDING AND QUASIMINIMALITY IN THE GENERIC DEGREES
scientific article; zbMATH DE number 6779955

    Statements

    DENSITY-1-BOUNDING AND QUASIMINIMALITY IN THE GENERIC DEGREES (English)
    0 references
    0 references
    0 references
    26 September 2017
    0 references
    generic computability
    0 references
    coarse computability
    0 references
    generic reducibility
    0 references
    coarse reducibility
    0 references
    density 1 bounding
    0 references
    quasiminimal
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references