Thats not true at all. If you think it is, I suggest you purchase a fantastic book called "Introduction to Algorithms."
All x86 processors are fundamentally the same, some are faster than others, but they are all the same. What I mean by this is (to make up some numbers), if a 500mhz takes 1ms to do an add operation and 100ms to do a multiply, then a 1000mhz takes .5ms to do an add and 50ms to do a multiply. The time it takes to do the multiply is less in the 1000mhz than in the 500mhz, but it is and ALWAYS will be more than the time it takes to do an add operation. The same holds true here. If the goto code uses operations that are ALWAYS slower than the ones used in the while loop, then it will ALWAYS be slower. For you to argue against that simply means you don't understand how a computer works. It is 100% possible, and also very common to be able to tell if an algorithm will ALWAYS be slower than another. There is an entire branch of computer science and of math that deals with it.
If you want to disagree, you are welcome to do so, but you are wrong.
