Forget my Prototype, the R. Fateman conjecture says   
   GCD algorithms are generally faster than doing   
   GCD via GB. Mostlikely this conjecture will completely   
      
   crash, because of methodological issues. I listed   
   some of the more foggy issues with this conjecture.   
   It has nothing to do with my Prototype or my Prolog system.   
      
   Am Freitag, 7. Juli 2017 02:24:42 UTC+2 schrieb Richard Fateman:   
   > On 7/6/2017 4:03 PM, bursejan@gmail.com wrote:   
   > > So lets say R. Fatemans conjecture is still undecided   
   > > in my opinion, what evidence do we have so far? Are there   
   > > some theoretical results that would support R. Fatemans   
   > > conjecture, not only some lousy maxima benchmarks?   
   >   
   > The timing tests show Maxima, and other CAS programs   
   > are maybe 3000X faster than your program.  This is not   
   > my opinion or your opinion.   
   >   
   > Maybe instead of writing messages here, you should go   
   > off and try to get your program to run maybe 1000X faster.   
   >   
   > RJF   
      
   --- SoupGate-Win32 v1.05   
    * Origin: you cannot sedate... all the things you hate (1:229/2)