2 ms·
There is a truth of the matter regarding whether a program will eventually halt or not, even when there is no computable proof for either case. Similar for the
by layer8 1y ago
There is a truth of the matter regarding whether a program will eventually halt or not, even when there is no computable proof for either case. Similar for the incompleteness theorems. The correct response in such cases is “I don’t know”.
- therobots927 1y agoYou know something I don’t hear a lot from chatGPT? “I don’t know”
- A4ET8a8uTh0_v2 1y agoTrue. Seemingly, based on my experiences, the instructions are to keep individual engaged for as long as possible. I hate to say it, but it works too.