This is the mail archive of the gcc@gcc.gnu.org mailing list for the GCC project.
| Index Nav: | [Date Index] [Subject Index] [Author Index] [Thread Index] | |
|---|---|---|
| Message Nav: | [Date Prev] [Date Next] | [Thread Prev] [Thread Next] |
| Other format: | [Raw text] | |
Sure it is. If the result falls into the predicted interval, and therefore the expected decision is made based on that then then the computation is correct.
There is a whole branch of mathematical approach to numerics based on interval aritmetic upon which on can base sofwtare construction with predictable results -- as far as the compiler implementer does not go his way of playing language lawyering non-sense. Have a look for example how interval airthmetic are used in computation geometry (http://www.cgal.org/ being the most popular), or in CAGD where it is quite important to get the correct topological structrure of shapes. In such context, algorithms are most of the time based on combination of numeric and symbolic computation and it is far more important to get a (numeric) computation correct than to get it fast.
I don't time left, and I'm not quite interested in distractive
language lawyering game. But I feel it is really misleading to
outright reject (correctness, predictability which together imply)
reproducibility.
-- Scott Robert Ladd Coyote Gulch Productions (http://www.coyotegulch.com) Software Invention for High-Performance Computing
| Index Nav: | [Date Index] [Subject Index] [Author Index] [Thread Index] | |
|---|---|---|
| Message Nav: | [Date Prev] [Date Next] | [Thread Prev] [Thread Next] |