Re: New benchmark

2002-01-11 Thread Dan Sugalski
At 08:44 AM 1/11/2002 +0100, Sebastian Bergmann wrote: >Dan Sugalski wrote: > > Okay, I've abused examples/assembly/life.pasm to be a benchmark > > program. It now will time generations/sec, and does rather more than > > mops.pasm does. > > Where can I find implementations of this algorithm in o

Re: New benchmark

2002-01-10 Thread Sebastian Bergmann
Dan Sugalski wrote: > Okay, I've abused examples/assembly/life.pasm to be a benchmark > program. It now will time generations/sec, and does rather more than > mops.pasm does. Where can I find implementations of this algorithm in other languages, for instance for Perl 5, Python, Ruby, ..? --

New benchmark

2002-01-10 Thread Dan Sugalski
Okay, I've abused examples/assembly/life.pasm to be a benchmark program. It now will time generations/sec, and does rather more than mops.pasm does. Something for testing as we go along. (The numbers are rather smaller, but it does do a lot more than mops does)