Nope, it also can't be proven that it'll search forever: it might halt a few billion years (or a few hundred ms) in. There's no period of time of searching after which you can say "it'll continue to run forever",as it might halt while you're saying it, which is embarrassing.
I am referring to the program H which I formally specified in the link I posted. H is a specific program which tries to determine if another program will halt.
I then show how to create a counter example for H. And show that if H returns either true or false, it creates a contradiction. Therefore it can't ever return true or false.
Therefore I've proved it will run forever. And this is just the standard proof of the halting problem. The weird part is that proving this also creates a contradiction.
If it's worth saying, but not worth its own post (even in Discussion), then it goes here.
Notes for future OT posters:
1. Please add the 'open_thread' tag.
2. Check if there is an active Open Thread before posting a new one. (Immediately before; refresh the list-of-threads page before posting.)
3. Open Threads should be posted in Discussion, and not Main.
4. Open Threads should start on Monday, and end on Sunday.