"Jean-Charles Meyrignac" <[EMAIL PROTECTED]> writes:
> > There is no KAI C/C++ compiler for Windows.
^^^^^^^^^^^
> Wrong, there have been a Kai C++ Compiler for NT: v3.3 in 1999.
^^^^^^^^^^^^^^^
So _actually_ there is not Kai C++ compiler for Windows, right?
> > KAI is the best C++ compiler all around. Intel C++ is quite far from
> > KAI in terms of compliance with the ISO C++ standard.
> >
> Intel C++ is intended to compile MSVC projects. And MSVC is not really an
> ISO compiler.
So far, there are no ISO C++ compliant compilers. If you mean that
MSVC intentionally introduces deviations from the C++ standard, I
agree.
> > And only to stay on-topic I will say that, as we all know, the best C
> > compiler can't compete with an experienced assembler programmer
> > producing efficient code. A different matter is if the long time the
> > programmer needs to produce the assembler code justifies the gain on
> > speed. I'm pretty sure we all agree on this point ;-)
> >
> Wrong again.
> Experienced programmers can code faster in assembly than in C code (this was
> my case ;-)).
Of course. I can code faster on pure machine code than in Orthogonal,
mostly because I have not idea about how Orthogonal works. (Yes, it
exists) :-)
[snip]
> I think that C compilers can produce BETTER code than assembly programmers
> in certain cases.
Only on those cases where the human programmer is not smart enough.
> For example, the Intel C++ compiler does optimize all branches, and this is
> really impressive, since it almost counts every cycle. All these
> optimizations take a lot of time for a programmer, and they are almost
> always neglected.
I'm pretty sure George did this using his mind. George has a dramatic
advantage over the compiler. The later knows nothing about the LL
test.
> Also, some parts can be pretty optimized. I'm thinking about a marvellous
> tool called SuperOptimizer (or Gnu SuperOpt). Its aim is to produce the
> smallest code possible given the input list and the output list. Of course,
> the process was very slow, and the longest code found was 7 instructions.
So it reduced even further the other cases? ;-) If I understand you
correctly we need to provide a list of mersenne numbers and a bit
representing if each one is prime or not. Those programs will generate
the optimal test. Really impressive. :-)
--
Oscar
_________________________________________________________________________
Unsubscribe & list info -- http://www.ndatech.com/mersenne/signup.htm
Mersenne Prime FAQ -- http://www.tasam.com/~lrwiman/FAQ-mers
