Timeline for How "correct" is Knuth's fast addition $(a,b) \mapsto (a \oplus b) \oplus ((a\land b) \ll 1)$?
Current License: CC BY-SA 4.0
12 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Oct 14 at 20:09 | history | edited | Dominic van der Zypen | CC BY-SA 4.0 |
deleted 6 characters in body
|
| Sep 21, 2023 at 18:01 | vote | accept | Dominic van der Zypen | ||
| S Sep 20, 2023 at 1:52 | history | edited | Michael Hardy | CC BY-SA 4.0 |
\liminf rather than \lim\inf. That way the subscript is in the right position.
|
| S Sep 20, 2023 at 1:52 | history | suggested | CommunityBot | CC BY-SA 4.0 |
\liminf rather than \lim\inf. That way the subscript is in the right position.
|
| Sep 20, 2023 at 1:50 | review | Suggested edits | |||
| S Sep 20, 2023 at 1:52 | |||||
| Sep 19, 2023 at 22:54 | answer | added | Jarosław Błasiok | timeline score: 12 | |
| Sep 19, 2023 at 22:34 | comment | added | Turbo | Related: mathoverflow.net/questions/394296/… | |
| Sep 19, 2023 at 22:12 | comment | added | Peter Taylor | I think this can be tackled as a Markov process with five states: one for rejected pairs and one for each combination of true and approximate carry digit, processing from least significant. | |
| Sep 19, 2023 at 21:00 | comment | added | Daniel Donnelly | Also, why don't you measure density in the bitwise space of numbers $a = (1,0,1,1,\dots)$. As we know that every combination of $0$'s and $1$'s will be occupied by a natural. | |
| Sep 19, 2023 at 20:54 | comment | added | Daniel Donnelly | Question: does the $+_K$ law form a group? I ask because I know that $\oplus$ forms a boolean ring together with $\wedge$ as multiplication. | |
| Sep 19, 2023 at 20:52 | comment | added | Daniel Donnelly | So I'm assuming your integers are arbitrary precision and bitwise operations past $a$'s most significant bit are fed zero bits (I.e. every number is zero-padded so that we can even talk about bitwise (componentwise) operations). | |
| Sep 19, 2023 at 20:40 | history | asked | Dominic van der Zypen | CC BY-SA 4.0 |