Search Results
| Search type | Search syntax |
|---|---|
| Tags | [tag] |
| Exact | "words here" |
| Author |
user:1234 user:me (yours) |
| Score |
score:3 (3+) score:0 (none) |
| Answers |
answers:3 (3+) answers:0 (none) isaccepted:yes hasaccepted:no inquestion:1234 |
| Views | views:250 |
| Code | code:"if (foo != bar)" |
| Sections |
title:apples body:"apples oranges" |
| URL | url:"*.example.com" |
| Saves | in:saves |
| Status |
closed:yes duplicate:no migrated:no wiki:no |
| Types |
is:question is:answer |
| Exclude |
-[tag] -apples |
| For more details on advanced search visit our help page | |
Results tagged with number-formats
Search options answers only
not deleted
user 755
For questions about method for storing and manipulating numbers on computer systems, such as floating point or binary representations.
4
votes
"Compressing" rationals given error bounds
Continued fractions are an efficient way to enumerate rational numbers that are a good approximation of your number $x$. In particular, given a real number $x$, you can generate a sequence of truncat …
D.W.♦
- 166k
3
votes
Accepted
What is the 1's and 2's complement of 0.01101?
One's and two's complement apply to (fixed-point) encodings of integers. They don't apply to floating-point numbers. Floating point is different.
D.W.♦
- 166k
2
votes
Space-efficient representation of potentially very large arbitrary-precision rationals?
Representing a rational number as ${a \over b} \times c^d$ where $a,b,c,d$ are integers can represent all three classes of numbers you mentioned efficiently. You can do standard operations on numbers …
D.W.♦
- 166k
2
votes
Why does little endian apply to numbers and not to text strings?
You certainly could do it that way. It's an arbitrary decision. You could store characters in ascending order, or in descending order.
D.W.♦
- 166k
2
votes
Is there any practical trick to mentally count in Gray code?
Wikipedia describes a very simple algorithm for this task:
To construct the binary-reflected Gray code iteratively, at step 0 start with the $\text{code}_0 = 0$, and at step $i > 0 $ find the bit pos …
D.W.♦
- 166k