Andrew Koenig <ark@research.att.com>: > The real point is to have small, efficient rational representations > for floating-point numbers, even those with large exponents. But how long are they going to *stay* small and efficient, once you start doing arithmetic on them? The problem as I see it is not the magnitude of the number, but that the number of significant bits grows without bound, if you never throw any of them away. Greg Ewing, Computer Science Dept, +--------------------------------------+ University of Canterbury, | A citizen of NewZealandCorp, a | Christchurch, New Zealand | wholly-owned subsidiary of USA Inc. | greg@cosc.canterbury.ac.nz +--------------------------------------+
RetroSearch is an open source project built by @garambo | Open a GitHub Issue
Search and Browse the WWW like it's 1997 | Search results from DuckDuckGo
HTML:
3.2
| Encoding:
UTF-8
| Version:
0.7.4