Just Launched: You can now import projects and releases from Google Code onto SourceForge
We are excited to release new functionality to enable a 1-click import from Google Code onto the Allura platform on SourceForge. You can import tickets, wikis, source, releases, and more with a few simple steps. Read More
It might not be the best method, but use the "top" command and check the
It should be available on your unix box....
From: Ben Pharr - Lists [mailto:ben-lists@...]
Sent: Tuesday, October 09, 2001 3:35 PM
Subject: RE: [clisp-list] overflow during multiplication of large
I tried starting with:
clisp -m 300MB
(ackermann 4 3)
It still gives me the same error. Any more ideas?
At 03:10 PM 10/9/01 -0500, you wrote:
>look at the "-m" on startup...
>From: Ben Pharr - Lists
>Sent: Tuesday, October 09, 2001 3:03 PM
>Subject: [clisp-list] overflow during multiplication of large numbers
>I have programmed a partially iterative function to calculate Ackermann's
>function. The iterative part is for cases of m=0 through m=3. Anything
>above that is done with recursion. I have compiled the function. A(4, 2)
>can be calculated in a fraction of a second. The result is a number with
>more than 19,000 digits. However, A(4, 3) gives me an error. It says:
>*** - overflow during multiplication of large numbers
>This occurs within a second of executing the function. I am doing this on
>Debian Linux, so I thought maybe the ulimit was getting in the way. ulimit
>is set to unlimited, and I have 320MBs of RAM. I thought maybe unlimited
>wasn't really unlimited, so I set it to 300MB and tried again with the same
>While it is possible A( 4, 3) would cause an overflow, I don't think it's
>taking enough time to find out, given how quickly A(4, 2) is computed. Can
>anyone give me some advice. Thanks!
>clisp-list mailing list
clisp-list mailing list