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

Gates implement the basic logic functions: AND OR NOT XOR Equivalence

example above (page B-6) are equal. Indeed that is

TTs. For example one can show that the two expressions for E in the

With DM (DeMorgan's Laws) we can do quite a bit without resorting to

First compute all the needed products and then the single sums.

That is it can be computed in just two time steps (assuming you

Each output is a sum of products of just inputs and their

The first way we solved part E shows that any logic function