What is the equation of XOR?
For example

let's say this is the standard form of XOR

A xor B

6 xor 4 = 2;

So,

Is it ( A xor B = ( A > B) ? A - B : B - A; (but either way the result is 2).

So I say that's not the way it is computed.

Let A=9 & Let B=12

A xor B = 5.. How, i was expecting 3 (LOL)


It looks like there are some conditions inside it.


Anyhbody know, I asked Google and all he said was the Boolean XOR equation. I interrogated him but still he refused to say.

xor is a digital logic gate that implements an exclusive disjunction, not absolute subtraction, that's the conditions.

XOR is the same as addition (and subtraction) but without any internal carries propagated.

For each bit in the operand:

0+0=0
0+1=1
1+0=1
1+1=0 (ignore the carry)

Works for subtraction also:

0-0=0
0-1=1 (ignore the carry)
1-0=1
1-1=0

The mathematical equivalent would be: bitwise A + B = C mod 2

Oh, so the trick is to just convert from whatever base you are in to base 2 and then use the truth table ?.......

AFAIK XOR is only defined in the binary domain. "boolean" is the word that should alert you to it being binary.

A xor B = (A or B) and ((not A) or (not B))
...and the wiki has several alternatives.

My BitBox helps to visualize such things...
http://board.flatassembler.net/topic.php?t=11615
Have fun