4 ms·
>Turing-completeness is difficult to avoid [...] For every addition to the language [...] we will have to very carefully prove that it cannot introduce any way
by zeteo 15y ago
>Turing-completeness is difficult to avoid [...] For every addition to the language [...] we will have to very carefully prove that it cannot introduce any way to create a non-terminating function.
Solving the halting problem doesn't mean all programs end - it means you can automatically determine whether an arbitrary program ends.
- evincarofautumn 15y agoYes. So? We’re not talking about the halting problem. The author wrote of total functional programming, a paradigm in which all functions and programs are provably terminating.
- zeteo 15y ago> we will have to very carefully prove that it cannot introduce any way to create a non-terminating function >The author wrote of total functional programming, a paradigm in which all functions and programs are provably terminating. So then what are you concerned about? Either use TFP, if indeed all your programs terminate, or have a different non-Turing complete approach, in which case you can still write infinite loops.