Muchnik degrees

E1751074 UNEXPLORED

Muchnik degrees are a structure in computability theory that classify sets of reals by the relative difficulty of non-uniformly computing one from another, forming a degree structure analogous to but more general than Turing degrees.

Try in SPARQL Jump to: Surface forms Referenced by

All labels observed (1)

Label Occurrences
Muchnik degrees canonical 1

Referenced by (1)

Full triples — surface form annotated when it differs from this entity's canonical label.

Turing degrees relatedTo Muchnik degrees