No, the halting problem is not concerned with "the stars would burn out", and encryption is not useful for proving its undecidability. Framing the halting probl

No, the halting problem is not concerned with "the stars would burn out", and encryption is not useful for proving its undecidability. Framing the halting problem as "can we find the answer before the heat death of the universe" is not an interesting take: The program "count to g_64" [0] will run incomprehensibly longer than the universe will exist, but yet it trivially halts. FWIW, your take boils down to https://xkcd.com/1266/ https://xkcd.com/1266/. [0] https://en.wikipedia.org/wiki/Graham%27s_number https://en.wikipedia.org/wiki/Graham%27s_number