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 the normal view instead:
scientific article; zbMATH DE number 6377236
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Complexity of equivalence relations and preorders from computability theory |
scientific article; zbMATH DE number 6377236 |
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
0.8420067429542542
0 references
0.836004376411438
0 references
0.83102947473526
0 references
0.8204061985015869
0 references
0.8108456134796143
0 references
