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

)time on

primes(1,1000000);

Type: List(Integer)

Time: 0.19 (IN) + 2.92 (EV) + 0.06 (OT) = 3.17 sec

vs.

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

Martin

OpenAxiom on Windows:

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

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

OpenAxiom on Linux:

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

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:

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

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

" class="equation" src="images/5327170976325199670-16.0px.png" width="560" height="263"/>