At 05:12 -0600 1998/11/24, Jan Skibinski wrote:
>> To paraphrase George Orwell, "All reductions are equal, but some are
>> more equal than others."
...
>So are assembly language instructions. Yet, I could think about
>some average instruction size for similarly written programs.
>Naive as my question might have been, I asked it anyway
>in hope to receive some insight how to compare similar algorithms
>in Hugs.
...
>If neither the reduction count nor the timing are appriopriate
>measures of efficiency in Hugs, then what is? Is there any
>profiling tool available for the interpreter?
Since modern CPU's are developed as to make more commonly used assembler
instructions faster, the only way to find out the speed of the components
of a program is to use a profiler.
Hans Aberg
* Email: Hans Aberg <mailto:[EMAIL PROTECTED]>
* Home Page: <http://www.matematik.su.se/~haberg/>
* AMS member listing: <http://www.ams.org/cml/>
