Nonexistence of minimal pairs for generic computability (Q5300075): Difference between revisions
From MaRDI portal
Changed an Item |
Normalize DOI. |
||
(One intermediate revision by one other user not shown) | |||
Property / DOI | |||
Property / DOI: 10.2178/jsl.7802090 / 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 | |||
Property / DOI | |||
Property / DOI: 10.2178/JSL.7802090 / rank | |||
Normal rank |
Latest revision as of 16:38, 30 December 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
Nonexistence of minimal pairs for generic computability (English)
0 references
24 June 2013
0 references
generic computability
0 references