TOPICS
Search

One-One Complete


A set is one-one complete if each of the recursively enumerable sets can be one-one reduced to it. If set A is many-one complete, then it is one-one complete, and vice versa.


See also

Many-One Complete, Recursively Enumerable Set, Reducible

Explore with Wolfram|Alpha

Cite this as:

Weisstein, Eric W. "One-One Complete." From MathWorld--A Wolfram Resource. https://mathworld.wolfram.com/One-OneComplete.html

Subject classifications