News for hackers. Stuff that matters.

A comment on On rebooting: the unreasonable effectiveness of turning computers off and on. Parent comment

Re:On rebooting: the unreasonable effectiveness of turning c... by legalcorrection on Wednesday May 25, 2022 @02:42PM (#31508742)
Maybe moving to a specific instance of Rice's theorem is clearer. My point is that while he can't solve the halting problem—i.e. he can't reliably determine whether any arbitrary program will halt—an infallible programmer can reliably write his own programs such that they always halt.

So, to go back to the original point, you can't reliably determine the correctness of every possible program. But you could, if you were not prone to error like all humans, always write your own programs such that they are always correct.

[ Parent | on HN ]
Re:On rebooting: the unreasonable effectiveness of turning c... by mkleczek on Wednesday May 25, 2022 @03:01PM (#31509030)
No.

From the fact that we know how to write programs that halt you cannot deduce we know how to write programs with arbitrary (or even just useful) property, because there is no general procedure to do that.

In other words: you cannot use the algorithm of writing programs that halt to write programs computing nth digit of Pi :)

[ Parent | on HN ]