Are there computational models that can be considered useful for solving common programming problems, where it can be proven that computation will terminate for all possible inputs?
Asked
Active
Viewed 53 times
1
-
1https://en.wikipedia.org/wiki/Primitive_recursive_function, https://en.wikipedia.org/wiki/Agda_(programming_language) – D.W. Jun 25 '17 at 04:10
-
You can consider any Turing-complete language together with a proof that the program halts. Most useful programs that halt can be proven to halt. – user253751 Apr 10 '23 at 00:43