That is an incorrect misinterpretation of the posts you are responding to.<p>If a programming language is Turing complete, then there is no way to prove that programs in that language halt <i>in the general case</i> (undecidable). The general case is important. It is not reasonable for a compiler which claims to detect halting to just bug out and refuse to compile certain valid programs. At best, people might still run a linting program which detects halting sometimes, but that flakiness is no good for the compiler.<p>One of the implications of the halting problem is that a language in which all valid programs halt is not Turing complete. If you mean to say that you think programming&#x27;s future is languages that are not Turing complete, just say so and then you can avoid delivering these condescending lectures to people who are operating under the reasonable assumption that future programming languages of general usefulness will be Turing-complete just like almost all the successful languages of the past have been.