Fabrizio Caruso wrote:
> Hi
>
> Is there a way to tell Maxima to automatically
> remember previously computed recursive steps
> in order to speed up computations?
>
>
yes. subscripted definitions are "memoized".
f[x]:= x*f[x-1]
f[0]:1
if you compute f[50], all values f[1] through f[50] are remembered.
Computing f[51] takes only one step.
> ------------------------------------------
>
> I also have a question on the quantity of available memory.
> If Maxima is used, say, with gcl, how do I get Maxima to
> see all the available memory (in my case 2 Gbytes).
> Is this a Lisp restriction?
> Should I configure gcl in oder to get the whole ram in Maxima?
> Could someone describe how to do that with gcl or any other lisp?
>
I think you have to specify your operating system. Most people who
think they need more memory really need to change their algorithms.
Sometimes even the best algorithm runs out of memory, but many symbolic
tasks use memory in a very
> Thanks
>
> Fabrizio
>
> _______________________________________________
> Maxima mailing list
> Maxima at math.utexas.edu
> http://www.math.utexas.edu/mailman/listinfo/maxima
>