 Enumeration reducibility

Enumeration reducibility is a concept from mathematical logic and computability theory, particularly in the study of recursive and recursively enumerable sets. It is a refinement of the idea of Turing reducibility.