Now, the output of our XOR gate is partially correct - 1 plus 1, outputs 0.
现在,我们的 XOR 门的输出是部分正确的——1 加 1,输出 0。
科技 Crash Course
So this set of inputs exactly matches the boolean logic of an XOR gate, and we can use it as our 1-bit adder.
所以这组输入与 XOR 门的布尔逻辑完全匹配,我们可以将它用作我们的 1 位加法器。
科技 Crash Course
So instead as we talked about in Episode 3 – we can use a high-level of abstraction and build our components out of logic gates, in this case: AND, OR, NOT and XOR gates.