13th October 2010, 2 min read Can you trust fixed-bit computer arithmetic? 3 thoughts on “Can you trust fixed-bit computer arithmetic?” Michael Stiber says: October 15, 2010 at 8:55 am This is a good example of why computing departments should teach scientific computing (one of many issues with finite state machines and mathematics). Daniel Lemire says: October 15, 2010 at 1:57 pm @Stiber Agreed. q says: October 16, 2010 at 12:36 pm On the other hand, if you can catch overflow, you’re back to having only one solution.
This is a good example of why computing departments should teach scientific computing (one of many issues with finite state machines and mathematics).
@Stiber
Agreed.
On the other hand, if you can catch overflow, you’re back to having only one solution.