-----maxima-bounces at math.utexas.edu wrote: -----
> There is just to compile("fastfib"), take the LISP code, clean it.
It isn't that easy. There are differences between fib and fastfib:
(%i11) [fastfib(-44),fib(44)];
(%o11) [6765,701408733]
Also fastfib(x) --> error and fib(x) ---> noun form. And fib modifies
the global prevfib. All these issues need to be resolved.
I can think of other fib related things that could be done
too---interaction with floor and ceiling, using recursion relations to
simplify expression involving Fibonacci functions, and converting fib
to a simplifying functions. These things take time.
Barton