Timeline for "Compressing" rationals given error bounds
Current License: CC BY-SA 3.0
13 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Aug 8, 2015 at 3:11 | vote | accept | Jake | ||
| Aug 7, 2015 at 12:21 | history | edited | David Richerby | CC BY-SA 3.0 |
So we don't need to start questions with "So".
|
| Aug 7, 2015 at 9:53 | history | edited | Raphael |
edited tags
|
|
| Aug 7, 2015 at 9:13 | history | tweeted | twitter.com/#!/StackCompSci/status/629581136931475456 | ||
| Aug 7, 2015 at 6:46 | answer | added | KWillets | timeline score: 3 | |
| Aug 7, 2015 at 6:08 | history | edited | Jake | CC BY-SA 3.0 |
clarified some things. added optimization tag
|
| Aug 7, 2015 at 5:28 | answer | added | D.W.♦ | timeline score: 4 | |
| Aug 7, 2015 at 4:57 | comment | added | Jake | So you could get it into any base you wanted by binary searching over the numerators of for base for the closest value in that base. So that gives an algorithm for converting to an arbitrary base at the very least. So that's some progress. | |
| Aug 7, 2015 at 4:06 | comment | added | Kittsil | I don't know of any. It's a great question, and I look forward to the general answer. | |
| Aug 7, 2015 at 3:38 | history | edited | Jake | CC BY-SA 3.0 |
latex fix
|
| Aug 7, 2015 at 3:37 | comment | added | Jake | Derp...I should I have thought of that. Still what about denominators that are more general? I'm reading Bishop's foundations of constructive analysis right now and it offers a slightly different method for which this wouldn't be the case so I'm still quite interested in the general question. | |
| Aug 7, 2015 at 3:27 | comment | added | Kittsil | I really like this question. I am not aware of any algorithms, but there is a clear solution for fractions with a denominator of $2^i$: since the prime factors of the denominator are all 2, you can just remove any on bits up to your given confidence. | |
| Aug 7, 2015 at 1:33 | history | asked | Jake | CC BY-SA 3.0 |