Unum Computing: An Energy Efficient and Massively Parallel Approach to Numerics

Re:Unum Computing: An Energy Efficient and Massively Paralle... by jlgustafson on Friday July 24, 2015 @07:12PM (#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. They do not represent ±1/2 or use ±1/2 as an endpoint.

If you add, say, 1 to (1,2), you get (2, inf). The open interval means it does not CONTAIN infinity, but ends at a finite value too large to represent. If the largest positive real you can represent is 2, then (2, inf) is a mathematically correct answer.

[ Parent | on HN ]

Re:Unum Computing: An Energy Efficient and Massively Paralle... by methodOverdrive on Saturday July 25, 2015 @06:48PM (#9949346)

D'oh, missed the NaNs and wrote out a list without referring to the book... then checked the length of the list to make sure it had 8 things. Silly me!

[ Parent | on HN ]

Re:Unum Computing: An Energy Efficient and Massively Paralle... by jacobolus on Friday July 24, 2015 @07:57PM (#9945937)

Your list should include -1 and 1 as well, shouldn’t it?

Edit: here was the slide http://i.imgur.com/0eQvvK1.png

[ Parent | on HN ]

Re:Unum Computing: An Energy Efficient and Massively Paralle... by tromp on Friday July 24, 2015 @08:29PM (#9946031)

Those would be among the 3-bit unums.

[ Parent | on HN ]