Pseudo-extensions of computable functions

One partial recursive function is a pseudo-extension of another just in case the former agrees with the latter on all but finitely many of those arguments for which the latter is defined. This paper deals with the problem of effectively modifying programs to make them halt on large classes of inputs. Solvable special cases of the problem of effectively finding programs (when they exist) for pseudo-extensions of partial recursive functions are characterized