Viewing profile — jlgustafson
jlgustafson
HN member- Joined
- Fri, Jul 24, 2015, 10:55 PM UTC
- HN karma
- 36
- Public activity
- 20 items
- HN profile
- View on Hacker News ↗
About jlgustafson
Recent public activity
-
comment
Comment #44408953
Sorry to be late to this discussion. Please be aware that there are a number of variations of the original posit definition that preserve the elegant properties (2's complement neg…
-
comment
Comment #35929105
IEEE 754 is just the codification of the Intel 8087 coprocessor design that John Palmer and Bruce Ravenel came up with. They brought in William Kahan as a consultant, and Kahan dis…
-
comment
Comment #35928718
Lots of free information on posits at www.posithub.org.
-
comment
Comment #35928703
The real hope is that 32-bit posits (with 512-bit quire for exact dot products and exact sums) can replace 64-bit floats where users hope 15-decimal accuracy in every variable mean…
-
comment
Comment #29057617
Exactly. Floating-point numbers cannot represent such numbers without error, yet we still see people asserting that floats represent "the entire real number line." The first format…
-
comment
Comment #29057564
"The End of Error: Unum Computing" is written for a popular audience, not fellow mathematicians. Only high school math is needed, and it's got plenty of humor and full-color illust…
-
comment
Comment #29057534
The original Stanford talk on posits suggested that they generate an exception and not the equivalent of a NaN. A few months later, I changed my mind and the (unique) NaR bit patte…
-
comment
Comment #29057268
I hope I'm not too late to the party to correct some things I see here. The big accomplishment of Kahan and IEEE 754 was to get companies to agree on where the sign, exponent, and …
-
comment
Comment #20401425
At the risk of a "flame war" where there are no winners, I would like to comment on some the statements here before they get stale. If we avoid ad hominem attacks and stick to the …
-
comment
Comment #14015342
Actually, posits handle NaNs already, by interrupting the calculation and doing whatever you have set up to handle the exception. What they do NOT do is represent Not-a-Number with…
-
comment
Comment #14015194
Isaac Yonemoto has suggested the use of ±∞ as a NaN, and it seems to work exactly like NaN does other than x/±∞ = 0 whereas you want x/NaN = NaN. I hate hardware exceptions. If you…
-
comment
Comment #13743335
I have been following this bug in its various form for 30 years, and it is covered in pages 55-62 of The End of Error: Unum Computing. It is the "hidden scratchpad" bug where desig…
-
comment
Comment #13743252
You say 1/0 = INF, but the 754 standard says negative zero is different, and 1/(-0) = -INF. Yet it says -0 is numerically equal to 0. It also specifies that the square root of -0 i…
-
comment
Comment #11640962
Plenty of experts refereed the book, believe me. William Kahan, David Bailey, Gordon Bell, Horst Simon, Ulrich Kulisch, John Gunnels, and anonymous reviewers as well. It was vetted…
-
comment
Comment #11415475
I have a chronic problem with people taking a partial description of some of my math, and then complaining about all the things that are missing. Well, those things are in the part…
-
comment
Comment #9946217
There is a whole chapter on "fixed-size unums" and the issues of making them just as easy to index as arrays as are floats. It really is not an obstacle; it's just more work for th…
-
comment
Comment #9946215
There is a whole chapter on "fixed-size unums" and the issues of making them just as easy to index as arrays as are floats. It really is not an obstacle; it's just more work for th…
-
comment
Comment #9945796
First of all, a correction: the 4-bit unums can represent any of -inf, (-inf, -2), -2, (-2, -1), (-1, 0), 0, (0, 1), (1, 2), 2, (2, inf), inf, and both quiet and signaling NaN. The…
-
comment
Comment #9945764
There are actually quite a number of places where Mathematica gives a wrong answer and unum math does not! For example, if you ask Mathematica to find all real values of x for whic…
-
comment
Comment #9945739
Suppose x and y are exact numbers. Then x+y is represented as the open interval (x, x+ULP) where x+ULP is the smallest representable exact unum greater than x. Since x is disjoint …