From: bobduff@shell01.TheWorld.com   
      
   Ray  writes:   
      
   > Things get hazier in the event of O(infinity) or non-halting programs   
   > - If you can use an infinite-sum rule to produce an executable that   
   > comes to a halt with the result that the source-code operation "would   
   > have" obtained if run to conclusion on some infinitely-fast computer,   
   > is that an optimization or is that cheating?   
      
   Could you please post an example of what you mean?   
      
   I've certainly seen cases where an infinite loop is   
   desired, but I'm not sure that answers your question.   
      
   - Bob   
   [I expect he means things like sum i=1 to infinity of 2^(-i) which we   
   know analytically is 1. -John]   
      
   --- SoupGate-Win32 v1.05   
    * Origin: you cannot sedate... all the things you hate (1:229/2)