ASYMPTOTIC DENSITY AND COMPUTABLY ENUMERABLE SETS (Q5401598): Difference between revisions

From MaRDI portal
RedirectionBot (talk | contribs)
Changed an 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 / arXiv ID
 
Property / arXiv ID: 1307.0040 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Matrix Transformation Is Complete for the Average Case / rank
 
Normal rank
Property / cites work
 
Property / cites work: Automorphisms of the lattice of recursively enumerable sets / rank
 
Normal rank
Property / cites work
 
Property / cites work: Jump equivalence of the Δ<sub>2</sub><sup>0</sup> hyperimmune sets / rank
 
Normal rank
Property / cites work
 
Property / cites work: Effectively categorical abelian groups / rank
 
Normal rank
Property / cites work
 
Property / cites work: The nonlow computably enumerable degrees are not invariant in $\mathcal {E}$ / rank
 
Normal rank
Property / cites work
 
Property / cites work: Backdoors to Satisfaction / rank
 
Normal rank
Property / cites work
 
Property / cites work: Average case completeness / 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 degrees of bi‐immune sets / 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: Genericity, the Arzhantseva-Ol'shanskii method and the isomorphism problem for one-relator groups. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Generic properties of Whitehead's algorithm and isomorphism rigidity of random one-relator groups. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Average Case Complete Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: A theorem on hyperhypersimple sets / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithmically finite groups. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Generic complexity of undecidable problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Degrees of Hyperimmune Sets / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computational complexity, speedable and levelable sets / rank
 
Normal rank
Property / cites work
 
Property / cites work: Turing Computability / rank
 
Normal rank

Latest revision as of 11:26, 7 July 2024

scientific article; zbMATH DE number 6267088
Language Label Description Also known as
English
ASYMPTOTIC DENSITY AND COMPUTABLY ENUMERABLE SETS
scientific article; zbMATH DE number 6267088

    Statements

    ASYMPTOTIC DENSITY AND COMPUTABLY ENUMERABLE SETS (English)
    0 references
    0 references
    0 references
    0 references
    10 March 2014
    0 references
    asymptotic density
    0 references
    computably enumerable sets
    0 references
    Turing degrees
    0 references
    low degrees
    0 references

    Identifiers