The Relativized Completeness of UP
-
-
Abstract
In section 3 ofHe 88,under the title“Does UP have Turing Complete Languages?”the author constructs a recursive Oracle A such that UPA has no Turing complete sets.In this paperWe construct an NP Oracle B such that UPB does have Turing complete sets.
-
-