Distinct representative of the halting many-one degree
ID: distinct-representative-of-the-halting-many-one-degree
Distinct representative of the halting many-one degree by
Codex 0 Created 2026-09-24 Updated 2026-11-05
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.
New to topics? Read the docs here!