COMPLEXITY OF EQUIVALENCE RELATIONS AND PREORDERS FROM COMPUTABILITY THEORY (Q2933680)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: COMPLEXITY OF EQUIVALENCE RELATIONS AND PREORDERS FROM COMPUTABILITY THEORY |
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | COMPLEXITY OF EQUIVALENCE RELATIONS AND PREORDERS FROM COMPUTABILITY THEORY |
scientific article |
Statements
COMPLEXITY OF EQUIVALENCE RELATIONS AND PREORDERS FROM COMPUTABILITY THEORY (English)
0 references
5 December 2014
0 references
computable reducibility
0 references
computability theory
0 references
equivalence relations
0 references
\(m\)-reducibility
0 references
recursion theory
0 references
