2 ms·
The halting problem has nothing to say against translating between languages. A non-terminating program will simply be translated into another non-terminating p
by yorwba 9y ago
The halting problem has nothing to say against translating between languages. A non-terminating program will simply be translated into another non-terminating program. In fact, Turing completeness is all about the fact that a program in any language can be translated into an equivalent program in another.
Some languages can't be parsed without solving the halting problem, but even in such cases, you can simply bundle it with an interpreter in the target language. And the subset of programs humans are actually likely to write should be much saner.