It is well known that there is a possible tradeoff in the binary representation of floating-point numbers in which one bit of accuracy can be gained at the cost of halving the exponent range, and vice versa. A way in which the exponent range can be greatly increased while preserving full accuracy for most computations is suggested.
No takes yet. Share an insight, caveat, or question.
Robert Morris (1971) studied this question.
Synapse has enriched 5 related papers. Consider them for comparative context: