
Re: Applying Mathematica to practical problems
Posted:
Jun 3, 2013 3:24 AM


On 6/1/2013 9:23 PM, Andrzej Kozlowski wrote: > This is one of many examples of "cross purpose" arguing. I was not > discussing implementing nonstandard analysis at all. My point was > that that there is nothing logically more dubious about a finite > "number" x such that x+1=1 than there is about a positive "number" x > such that nx< 1 for every positive integer n, or, alternatively, > finite "number" x such that x/n >1 for every positive integer n. > Mathematicians often use the word "number" when referring to objects > belonging to some "extension" of the real line.
Oh where to start. Here's one place.
You say it is ok to have a number x such that x+1=1. I agree. I say it is NOT ok to have a number x such that x+1=x. You respond It is ok to have a number x such that x+1=1. Can you see the difference?
Here's another.
AK says DanL says he wrote programs using significance arithmetic and they worked.
There are other places in Mathematica in which significance arithmetic MUST NOT be used. Convergent iterations, generally. Will naive users be led astray by this kind of situation? Maybe.
Also is the Grobner basis program in Mathematica the fastest? I suspect it is not, though I have not compared it to Faugere's work, or other unnamed systems. Is it the only one using significance arithmetic? I suspect it is. What would that prove? What would that prove about use as a default?
Finally, I would remind AK (and others) that proving some number of correct results does not prove an algorithm is correct. Proving even one incorrect result demonstrates a bug.
RJF

