3 ms·

Dying to try this out. Is anyone working on a lookup table-based C implementation yet?

• antiquark 11y ago
  Prolly an etiquette violation to crosspost to reddit, but I wrote a little "bootleg" version of unums in C++. There seems to be some inherent problems with the unum2 concept though: * The smallest non-zero value is 1e-9. * The biggest non-infinite value is 1e9. * The first integer that shows roundoff error is 3. * The integer 100001 loses its last digit. 100001 -> unum -> float = 100000. See the link at: https://www.reddit.com/r/programming/comments/4d08g0/a_radical_approach_to_computation_with_real/d1oahe4 https://www.reddit.com/r/programming/comments/4d08g0/a_radic...
  • tlack 11y ago
    Hmmm. But isn't the idea of unum2 that the size of the representation, and hence its properties, can and should vary by application?
    • antiquark 11y ago
      Yes, but I thought I would try one that takes 4 bytes like a float, just to see how it compares.