The set is also a computably enumerable set, so the many-one completeness of the halting problem gives . Together the two many-one reductions place and in the same many-one degree.
Articles by others on the same topic
There are currently no matching articles.