https://issues.dlang.org/show_bug.cgi?id=14419

--- Comment #8 from Ketmar Dark <[email protected]> ---
determining finiteness of arbitrary algorithm is one of the greatest problems
of current AI research. ;-)

i believe that it's better to not start. the code for checking various cases
will grow and grow and grow, and there allways will be much more cases that it
can't detect. and people will open bug reports for "bug in infinite loop
detection", and more special cases will be added. this process is infinite. ;-)

i think it's better to simply don't do that, and document the fact that CTFE
engine doesn't do infinite loop detection.

--

Reply via email to