Thu, 13 Jul 2000 20:53:50 PDT
>You are, however, bypassing the importance of Rice's Theorem, and I
>understand why you feel justified in that. If it's impossible to
>which program is faster, how can you be justified in claiming that you
>choose the fastest? I myself would choose instead the smallest, not
>fastest; I wouldn't always be right, but at least I would often be,
>a decision which is easy to make.
I suspect it may be significant that all of the examples Lynn has
offered involved code that did, provably, complete. But optimising
simple equations to within a hair's breadth of perfect leaves you with
vastly inefficient control flow structures.
But the thing is, most compilers are already doing a reasonable
approximation of this, are they not?