Suppose, to the contrary, that there exists a computable algorithm for some undecidable decision problem. Would this mean that halting problem would be solved by a computable algorithm? I know that the converse is true for a decision problem in RE complexity class, but not for the other way around.
Is there an undecidable decision problem that computable algorithm for it leads to an algorithm for halting problem?
computability;undecidability;halting problem