Turing reduction and degrees

Layer 0 — Mathematicsin the formal-systems-limits subtree

A ≤_T B means A is computable by a Turing machine with oracle access to B. Equivalent to A being effectively decidable once membership queries in B are allowed. The equivalence classes under ≤_T form the Turing degrees, with ∅…

Related concepts

Explore Turing reduction and degrees on the interactive knowledge graph →