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.
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
Hwhich 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 ifHreturns eithertrueorfalse, it creates a contradiction. Therefore it can’t ever returntrueorfalse.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.