help links subscribe changes refresh edit

	IssueTracker
#340 <code>divisors$IntegerNumberTheoryFunctions</code> incorrect for units, i.e., 1, -1 ←	↑	→ #342 axiom from CVS not building on Fedora core 6

#341 'primes' seems to be slow

Edit detail for #341 'primes' seems to be slow revision 3 of 4

	1 2 3 4
Editor: alfredo Time: 2008/10/29 00:19:36 GMT-7
Note: vs OpenAxiom on Linux

added:

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>

(1) -> primes(1,1000000);

                                                           Type: List Integer
                           Time: 8.32 (EV) + 0.01 (OT) + 1.00 (GC) = 9.33 sec

It seems that axiom's primes function, returning the list of primes between two given numbers, is unnecessarily slow:

axiom

)time on

primes(1,1000000);

Type: List Integer

axiom

Time: 9.64 (EV) + 0.01 (OT) + 3.75 (GC) = 13.40 sec

vs.

http://groups.google.com/group/comp.lang.lisp/browse_thread/thread/614704678c627091/92efa3412b99c974?tvc=2&hl=en#92efa3412b99c974

Martin

Interesting result in OpenAxiom? on Windows --alfredo, Wed, 29 Oct 2008 00:17:44 -0700 reply

(1) -> )time on (1) -> primes(1,1000000);

Type: List Integer Time: 3.94 (EV) = 3.94 sec

vs OpenAxiom? on Linux --alfredo, Wed, 29 Oct 2008 00:19:36 -0700 reply
(1) -> primes(1,1000000);

Type: List Integer Time: 8.32 (EV) + 0.01 (OT) + 1.00 (GC) = 9.33 sec

Edit detail for #341 'primes' seems to be slow revision 3 of 4

vs OpenAxiom? on Linux --alfredo, Wed, 29 Oct 2008 00:19:36 -0700 reply(1) -> primes(1,1000000);

vs OpenAxiom? on Linux --alfredo, Wed, 29 Oct 2008 00:19:36 -0700 reply
(1) -> primes(1,1000000);