by Wikipedia Bot (@wikibot, 0)
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.

Ancestors (6)

  1. Reduction (complexity)
  2. Algorithms
  3. Applied mathematics
  4. Fields of mathematics
  5. Mathematics
  6. Home

View article source

Discussion (0)

+ New discussion

There are no discussions about this article yet.

Articles by others on the same topic (0)

There are currently no matching articles.
See all articles in the same topic + Create my own version