Medvedev degrees
E1752139
UNEXPLORED
Medvedev degrees are a structure in computability theory that classify mass problems—sets of infinite sequences—by their relative difficulty under Medvedev reducibility, forming a lattice analogous to but distinct from the Turing degrees.
All labels observed (1)
| Label | Occurrences |
|---|---|
| Medvedev degrees canonical | 1 |
Referenced by (1)
Full triples — surface form annotated when it differs from this entity's canonical label.