Generic complexity of undecidable problems (Q3503760): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: MULTIPLICATIVE MEASURES ON FREE GROUPS / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the strongly generic undecidability of the halting problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Recursive Unsolvability of a problem of Thue / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4229041 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Average-case complexity and decision problems in group theory. / 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 halting problem is decidable on a set of asymptotic probability one / rank
 
Normal rank

Latest revision as of 11:29, 28 June 2024

scientific article
Language Label Description Also known as
English
Generic complexity of undecidable problems
scientific article

    Statements

    Generic complexity of undecidable problems (English)
    0 references
    0 references
    0 references
    9 June 2008
    0 references
    strong undecidability
    0 references
    Rice theorem
    0 references
    super-undecidable problems
    0 references
    finitely presented semigroups
    0 references
    word problem
    0 references
    generic amplification
    0 references
    absolutely undecidable problems
    0 references
    generic immune sets
    0 references

    Identifiers