I find that this:
floor (log (2^(floor (log (- 1)) - 1) - 1));
causes a stack overflow. Happens w/ current Git Maxima + Clisp and SBCL.
Some similar examples just take a while to run to completion -- maybe it is not an unbounded recursion, but rather a problem that could be solved by using a bigger stack. I didn't investigate that.
That is the simplest example I could find -- removing some of the bits makes it run to completion.
Log in to post a comment.