To solve any decision problem P with the Halting oracle, we can reformulate it as program source code: “if P, then halt; otherwise: loop forever” and feed this program to the Halting oracle.
Is “computable” understood as being implicit in the term “decision problem P”?
Is “computable” understood as being implicit in the term “decision problem P”?
Yes.