Notions of robust information coding (Q5283443): Difference between revisions
From MaRDI portal
Changed an Item |
ReferenceBot (talk | contribs) Changed an Item |
||
Property / cites work | |||
Property / cites work: ASYMPTOTIC DENSITY AND COMPUTABLY ENUMERABLE SETS / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Cohesive avoidance and strong reductions / 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: Generic computability, Turing degrees, and asymptotic density / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4040892 / rank | |||
Normal rank |
Latest revision as of 03:48, 14 July 2024
scientific article; zbMATH DE number 6751263
Language | Label | Description | Also known as |
---|---|---|---|
English | Notions of robust information coding |
scientific article; zbMATH DE number 6751263 |
Statements
Notions of robust information coding (English)
0 references
21 July 2017
0 references
generic computability
0 references
generic case complexity
0 references
coarse computability
0 references