Talk:Generalised floating point addition: Difference between revisions
Talk:Generalised floating point addition (view source)
Revision as of 10:35, 31 October 2011
, 12 years ago→Repeating the "why"?
Line 87:
:BCD was a great hack when you had to fit all of your code into a few kilobytes of memory. But (for example) representing dollars as cents, to avoid the binary fraction issues, is also a great hack. Nowadays, BCD is mostly useful for backwards compatability and in systems that have included BCD support without supporting other options.
:So, anyways, if I wanted to illustrate polynomial multiplication, I would not bother with BCD. Instead, I would focus on something like the [[wp:Chain rule (probability)|chain rule]]. For example: ''If you flip a coin ten times, with 50% odds each for "Heads" and "Tails" on one coin flip, what are the odds that the total number of "Heads" is a prime number?''. Or something like that that involves summing cumulative probabilities -- perhaps involving dice or perhaps even something with uneven base chances. If you like, I could draft up a task on that subject. (Or feel free to do so yourself.) --[[User:Rdm|Rdm]] 10:33, 31 October 2011 (UTC)
| |||