|
|
last edited 16 years ago by alfredo |
1 2 3 4 | ||
Editor: alfredo
Time: 2008/10/29 00:23:10 GMT-7 |
||
Note: vs OpenAxiom on Linux |
changed: -From alfredo Wed Oct 29 00:17:44 -0700 2008 -From: alfredo -Date: Wed, 29 Oct 2008 00:17:44 -0700 -Subject: Interesting result in OpenAxiom on Windows -Message-ID: <20081029001744-0700@axiom-wiki.newsynthesis.org> \begin{verbatim} OpenAxiom on Windows: changed: -From alfredo Wed Oct 29 00:19:36 -0700 2008 -From: alfredo -Date: Wed, 29 Oct 2008 00:19:36 -0700 -Subject: vs OpenAxiom on Linux -Message-ID: <20081029001936-0700@axiom-wiki.newsynthesis.org> OpenAxiom on Linux: added: \end{verbatim}
It seems that axiom's primes
function, returning the list of primes between two given numbers, is unnecessarily slow:
(1) -> )time on
primes(1,1000000);
Time: 0.45 (EV) = 0.45 sec
vs.
Martin
OpenAxiom on Windows:
(1) -> )time on (1) -> primes(1,1000000);
Type: List Integer Time: 3.94 (EV) = 3.94 sec
OpenAxiom on Linux:
Type: List Integer Time: 8.32 (EV) + 0.01 (OT) + 1.00 (GC) = 9.33 sec
" title="
OpenAxiom on Windows:
(1) -> )time on (1) -> primes(1,1000000);
Type: List Integer Time: 3.94 (EV) = 3.94 sec
OpenAxiom on Linux:
Type: List Integer Time: 8.32 (EV) + 0.01 (OT) + 1.00 (GC) = 9.33 sec
" class="equation" src="images/5327170976325199670-16.0px.png" align="bottom" Style="vertical-align:text-bottom" width="816" height="1056"/>