All Questions
Tagged with computer-science infinite-combinatorics
1 question with no upvoted or accepted answers
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, $\...
- 48.9k