No you won't. Pick any finite time you will check. It may not stop by then, yet may stop later. So ahead of time, even if the program will stop, you cannot make a plan to learn that in finite time. You're stuck letting run possibly forever, because at each finite time you still cannot answer yes or no. Only if you've waited long enough, which can be arbitrarily far out, and it stops, can you answer.
> Only if you've waited long enough, which can be arbitrarily far out, and it stops, can you answer
So, we agree!
But that is not the only possibility. So you are missing the point.
They are not missing the point. The previous post was simply wrong. The halting problem is semi-decidable. So you can potentially find out wether a program halts.
Besides missing the point, this is also pedantic and quite boring.