Abstract

Multivalued functions are common in computable analysis (built upon the Type 2 Theory of Effectivity), and have made an appearance in complexity theory under the monikersearch problemsleading to complexity classes such as PPAD and PLS being studied. However, a systematic investigation of the resulting degree structures has only been initiated in the former situation so far (the Weihrauch-degrees).A more general understanding is possible, if the category-theoretic properties of multivalued functions are taken into account. In the present paper, the category-theoretic framework is established, and it is demonstrated that many-one degrees of multivalued functions form a distributive lattice under very general conditions, regardless of the actual reducibility notions used (e.g. Cook, Karp, Weihrauch).Beyond this, an abundance of open questions arises. Some classic results for reductions between functions carry over to multivalued functions, but others do not. The basic theme here again depends on category-theoretic differences between functions and multivalued functions.

Full Text
Published version (Free)

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call