Skip to main content

All Questions

Filter by
Sorted by
Tagged with
2 votes
0 answers
149 views

Binary operation approximating "addition" on $2^\omega$

Motivation. In computer science, addition of integers $a+b$ can be approximated by a very fast operation: $(a,b)\mapsto (a\oplus b) \oplus ((a\land b) \ll 1)$, where $\oplus$ denotes bitwise XOR, $\...
Dominic van der Zypen's user avatar