Yeah ... but it WILL terminate ...

and even if recursion-depth will be 2^32 .... it WILL terminate ...

you can't tell this for every function if the "machine" is turing-complete

... or better the other way around:

If  a function terminates, then: fine...
but if it is running, there's no algorithmic way, to determine if this function will
ever terminate or not ...
Your only chance is to wait and see ...

of course, there are trivial ones, but for every function you find, that is possible
to tell, there are infinite other functions,
where you can't tell ...

Post a reply to this message