On Thu, Dec 13, 2012 at 3:07 PM, Boyko Bantchev <[email protected]> wrote: >> It's the same in the sense that given the same coefficients we get the >> same result. > > So, according to you, any method that computes the value of a polynomial > given its coefficients is the "Horner's method"?
No, I was giving you some of my interpretations of the words that you wrote. Of course, you can reasonably argue that none of my interpretations make sense. But that is because I cannot find any interpretation of your words that makes sense to me. You gave me nothing concrete to go on and made a statement which flat out contradicts what I observe. (Note that this does not mean that there are no valid interpretations of your words -- just that I have not yet been able to find one.) If we are to continue this discussion, I would appreciate if you could give me an example that illustrates the difference you are speaking of. That said, if you are trying to argue that the algorithm used by #. is not equivalent to horner's rule, consider that you can supply different 'x' values to #. to use at each stage of evaluation, to show that it would be the right algorithm were those values the same instead of different. Thanks, -- Raul ---------------------------------------------------------------------- For information about J forums see http://www.jsoftware.com/forums.htm
