3 ms·
And not every programming language is Turing-complete which means there are languages without loops that are guaranteed to terminate. https://en.wikipedia.org/
by anaphor 7y ago
And not every programming language is Turing-complete which means there are languages without loops that are guaranteed to terminate.
https://en.wikipedia.org/wiki/Total_functional_programming https://en.wikipedia.org/wiki/Total_functional_programming