There are a few possible responses to this.
1. Maybe your simple procedure does not terminate, and no size stack
will allow it to complete.
2. Maybe the stack allocation in whatever lisp you are using is too
small, and should be made larger so that your program can complete.
only after these issues are raised would I recommend that you reprogram
your algorithm (unless it is indeed a very simple algorithm and is even
simple when it is written iteratively instead of recursively).
perhaps you should post your program so we can see if it is obviously
and wastefully recursive?
RJF
van Nek wrote:
> Am 5 Apr 2007 um 10:35 hat sen1 at math.msu.edu geschrieben:
>
>> Hello,
>> On some simple procedures, I get a 'bind stack overflow'.
>
>
> Sheldon,
>
> I guess, you are using a recursive algorithm. Translating to Lisp
> and/or compiling helps a lot to increase the number of possible
> iterations, but at a certain amount you'll get this message again. If
> your algorithm needs thousands of iterations you better should look
> for nonrecursive code.
>
> Volker
>
>------------------------------------------------------------------------
>
>_______________________________________________
>Maxima mailing list
>Maxima at math.utexas.edu
>http://www.math.utexas.edu/mailman/listinfo/maxima
>
>