что такое xor and or not

There are definitely simpler and better ways to implement XOR, but this is the most straightforward transformation starting from the logical expression.

This could be implemented using our normal control (AND) and inverted control (NOT) transistors.

(not (and (not (and a (not b))) (not (and (not a) b))))

So, the logical expression above is equivalent to:

We saw how to make or out of and and not in class using De Morgan’s Law:

We got many interesting answer to this, some of which I’ll show in class (5 October). A simple solution is to view xor as the logical expression,

Question 1: (Turn in on paper) Design a machine that can compute the exclusive-or of two inputs. Your machine can use the normal control and inverted control transistors we introduced in class.

PS4 – Comments | cs1120: Introduction to Computing