equivalence classes under Turing reducibility

C52302 concept

Equivalence classes under Turing reducibility are sets of decision problems (or sets of natural numbers) where each member can compute every other via a Turing reduction, grouping problems by their mutual computational power.

Instances (1)