On 2/08/2012 8:07 PM, John Gilmore wrote:
Any standard logic text establishes that
o AND, inclusive OR, and NOT are together universal,
o NOR alone is universal, and
o NAND alone is universal.
Thus, in an obvious notation,
XOR(a,b) =df (a | b) & (¬(a & b))
What is all the pother about?
Because it's not done in the hardware to make it self-documenting?
John Gilmore, Ashland, MA 01721 - USA
----------------------------------------------------------------------
For IBM-MAIN subscribe / signoff / archive access instructions,
send email to [email protected] with the message: INFO IBM-MAIN
----------------------------------------------------------------------
For IBM-MAIN subscribe / signoff / archive access instructions,
send email to [email protected] with the message: INFO IBM-MAIN
