On 5/2/07, Michael Kay <mike(_at_)saxonica(_dot_)com> wrote:
> It could be the memory space available to hold the longest
> number is limited, and not particularly the recursive depth.
> Although I could be wrong, because I know little.
Saxon uses Java's BigInteger. Arithmetic performance will become impossibly
slow long before you hit the size limits on a BigInteger.
It appears to me that BigInteger doesn't really have a limit because
by increasing the memory, the calculation of even larger factorials
(larger than 10446) becomes possible with Saxon.
I won't try to calculate the limit as I don't want to burn the RAM :-)
Michael Kay
http://www.saxonica.com/
-Regards
Rashmi
--~------------------------------------------------------------------
XSL-List info and archive: http://www.mulberrytech.com/xsl/xsl-list
To unsubscribe, go to: http://lists.mulberrytech.com/xsl-list/
or e-mail: <mailto:xsl-list-unsubscribe(_at_)lists(_dot_)mulberrytech(_dot_)com>
--~--