TOTALLY ω-COMPUTABLY ENUMERABLE DEGREES AND BOUNDING CRITICAL TRIPLES (Q3521597): Difference between revisions
From MaRDI portal
Latest revision as of 15:23, 28 June 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | TOTALLY ω-COMPUTABLY ENUMERABLE DEGREES AND BOUNDING CRITICAL TRIPLES |
scientific article |
Statements
TOTALLY ω-COMPUTABLY ENUMERABLE DEGREES AND BOUNDING CRITICAL TRIPLES (English)
0 references
26 August 2008
0 references
computational complexity
0 references
Turing reducibility
0 references
definability
0 references
computability theory
0 references
Turing degrees
0 references
critical triple
0 references
0 references
0 references