3 ms·
Essentially, the problem is not with computers, but with languages. If your language lets you build a neverending loop/datastructure/etgc, then you cannot prov
by pyrale 8y ago
Essentially, the problem is not with computers, but with languages.
If your language lets you build a neverending loop/datastructure/etgc, then you cannot prove halting for all the programs that can be made by the language.
Since such languages exist, then by extension, it applies to computers.