Speed comparison of Feldman's software posits ("universal numbers") vs existing hardware floats?

Viewed 52

The proposed posits ("universal numbers") implementation by Michael Feldman seems quite interesting.

Has anyone performed any benchmarks to compare his implementation (in software) against existing hardware floats speeds?

I am curious as to whether there's any speed advantage at all in implementing this for a programming language to use as a default universal number system vs using existing hardware support. It seems doubtful, but certainly worthy of curiosity.

0 Answers
Related