Nonexistence of minimal pairs for generic computability (Q5300075): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
 
(3 intermediate revisions by 3 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2024128940 / rank
 
Normal rank
Property / arXiv ID
 
Property / arXiv ID: 1202.2560 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Average Case Complete Problems / 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: ASYMPTOTIC DENSITY AND COMPUTABLY ENUMERABLE SETS / rank
 
Normal rank
Property / cites work
 
Property / cites work: Average case completeness / rank
 
Normal rank
Property / cites work
 
Property / cites work: Generic computability, Turing degrees, and asymptotic density / rank
 
Normal rank

Latest revision as of 13:22, 6 July 2024

scientific article; zbMATH DE number 6180296
Language Label Description Also known as
English
Nonexistence of minimal pairs for generic computability
scientific article; zbMATH DE number 6180296

    Statements

    Identifiers