Turning switch 11 on gives us 110 by standard binary addition.

根据标准二元进位法，如果打开 11，我们会得到 110。

Although recording methods have changed, the decimal system has triumphed throughout.

虽然记录方法发生了变化，但十进位制在整个过程中都占着主导地位。

Or in a given row, treat each number as part of a decimal expansion.

是将其中一列作十进位展开。

Each bit can be either a zero or a one in the binary language of computing.

在计算机的二进位语言中，每个比特代表01。

Right, the Dewey decimal classification system which was invented by Melville Dewey, an American librarian, not John Dewey, the philosopher.

杜威十进位分类法是由梅尔维尔·杜威发明的，他是一位美国图书管理员，而不是哲学家约翰·杜威。

I think that's what's nice is this was not dependent on 20 carries.

我认为这很好，因为这不依赖于 20 个进位。

So 17 carries between the last two years.

因此过去两年内共有 17 次进位。

Obviously, 27 carries is a very outrageous number.

显然，27次进位是一个非常离谱的数字。

Well, they don't do carrying over like we used to do.

现在算进位的方法已经跟我们当年不一样了。

So two carries inside the five.

所以五个进位里面有两个进位。

And this is going to be- Five zone carries.

这将是——五区进位。

There's some added steps with carries and the like but the core step is a convolution.

有一些带有进位等的附加步骤，但核心步骤是卷积。

You have two inputs, A and B, and you have a sum output and a carry output.

您有两个输入 A 和 B，并且有一个总和输出和一个进位输出。

But, we need an extra output wire for that carry bit.

但是，我们需要一个额外的输出线用于那个进位。

That is- Eight five zone carries.

那就是——八个五区进位。

An additional downside is that it takes a little bit of time for each of the carries to ripple forward.

另一个缺点是每个进位都需要一点时间才能向前波动。

Now we add 8 plus 1 plus the 1 we carried, that's 10, so the sum is 0 carry 1.

现在我们加上 8 加 1 再加上我们进位的 1，就是 10，所以和是 0 进位 1。

Yeah. So, um, Javante and McLaughlin kind of split carries. It wasn't like Javante looked a little better.

是的。所以，嗯，Javante 和 McLaughlin 是一种分拆进位。贾万特看起来并没有好一点。

Um, but looking at like five zone carries, no, that's, that's the money.

嗯，但是看看五个区域的进位，不，就是这样，这就是钱。

Lastly, we need a OR gate to check if either one of the carry bits was true.

后，我们需要一个门来检查其中一个进位是否为真。