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 ncmncm on Wednesday May 25, 2022 @05:08AM (#31502106)
Because you built it in a series of steps, exactly zero of which introduced any undecidability.
[ Parent | on HN ]
Re:On rebooting: the unreasonable effectiveness of turning c... by mkleczek on Wednesday May 25, 2022 @05:34AM (#31502258)
See above - there is no reliable procedure (algorithm) that would allow you to build a TM with arbitrary properties (ie. implementing arbitrary requirements).
[ Parent | on HN ]
Re:On rebooting: the unreasonable effectiveness of turning c... by SAI_Peregrinus on Wednesday May 25, 2022 @12:32PM (#31506826)
Programs don't have to have Turing-complete behavior. Compilers do, but not every program needs to implement uncomputable behavior on its inputs.
[ Parent | on HN ]
Re:On rebooting: the unreasonable effectiveness of turning c... by mkleczek on Wednesday May 25, 2022 @01:09PM (#31507372)
Actually it's the other way around:

In reality most interesting programs accept Turing complete languages - albeit not formally specified :)

[ Parent | on HN ]