Bitwise Agreement
Refers to the mathematical state of 2 bits \( A \) and \( B \) where \( A = B \) means \( A \) agrees with \( B \) (otherwise \( A \) disagrees with \( B \)).
Agreement forms the following truth [see page 7, table]:
| \(A\) | \(B\) | \(A \text{Agrees with} B\) |
|---|---|---|
| 0 | 0 | 1 |
| 1 | 0 | 0 |
| 0 | 1 | 0 |
| 1 | 1 | 1 |