You can come up with examples where it's infeasible for a programmer to decide halting, but that's not the same thing, because feasibility is just about the amo

You can come up with examples where it's infeasible for a programmer to decide halting, but that's not the same thing, because feasibility is just about the amount of time or resources it would take to do something. One can imagine giving an arbitrarily difficult program to an arbitrarily bored programmer, and having an answer to whether it'll halt after ten years. But that's pure thought experiment, because nobody would ever actually do it, because it wouldn't be worth doing. That is, the undecidability of the halting problem hinges on the need to specify a mechanical/formal process for making the decision, which cannot be done.