-
Now, the decision tree, if I branch left, it's a binary tree.
现在，这个决策树，如果我走左边的分支，这是一棵二叉树。
-
Happiness is not a binary either-or, zero-one-- either I'm happy or I'm unhappy.
幸福不是二进制的非此即彼，0或-,要么幸福要么不幸福。
-
So, it makes a binary decision, either I create an action potential or I don't, but that decision could be based on many inputs, not just on input from one cell.
所以 这里产生一个二选一的决策,就是产生动作电位亦或不产生,不过这个决定可能是,根据很多输入信号做出的,而不是仅凭单个细胞所传来的信号
-
to the n, every value in the 1 bit vector we looked at last time is either 0 or 1. So it's a binary n number of n bits, 2 to the n.
从2到n，我们上次看到的,位向量的每个值不是0就是,所以它是n，比特的二进制数,从2到。
-
A patterned series of these tiny charged berries on the disk represents a single bit of data in the binary number system used by computers.
这些在磁盘上的有序的小粒子,代表这个当代计算机中,二进制中单独的一位。
-
It is a declaration of absolute interdependency among the things that we understand in binary terms but that we take somehow one to be causative of the other when we think about them.
这是在宣布事物之间的绝对的相互性,我们能在二元关系上理解这些事,但是我们惯常于把一个是当成另一个的原因。
-
We started off talking about binary search, and I suggested that this was a log algorithm which it is, which is really kind of nice.
我告诉了你们这是一个对，数级的算法，这是很棒的,我们来一起看看这个算法到底做了什么。
-
OK. So, what do I want you to take away from this? This idea of binary search is going to be a really powerful tool. And it has this property again, of chopping things into pieces.
从这里学到些什么？二分查找的思想,是一个非常有用的工具,我重复一遍，把问题拆成几部分来解决,那事实上，这里的增长率是多少？
-
This was using something called a bisection method, which is related to something called binary search, which we'll see lots more of later, to find square roots.
你应该想起来,我们是以一个,叫做二分法求平方根的问题结束的，它运用了二分法去求一个数的平方根，二分法和我们将要花很多时间。
-
In binary search-- ah, there's that wonderful phrase, this is called a version of binary search just like you saw bin-- or bi-section methods, - when we were doing numerical things- in binary search, I need to keep track of the starting point and the ending point of the list I'm looking at.
就是当我们处理数字的时候，所称的二分检索，在二分法搜索中,我需要记录区间的开始点和尾点，初始化的时候就是-,问题输入的开始点和尾点，当我开始做测试的时候,我想要做的就是去取中值点。
-
So just as a little sanity check, number 15 in binary would be?
再来做个测试，那么二进制中15怎样表达？
-
If I look in the binary case, takes a little longer.
这里的输出，告诉我们。
-
Voice and writing, by the way, are not a stable binary.
顺道说一句，声音和文字不是稳定的二元系统。
-
Again. Basic premise of binary search, or at least we set it up was, imagine I have a sorted list of elements. We get, in a second, to how we're going to get them sorted, and I want to know, is a particular element in that list..
好，二分查找的基本前提，或者是我们建立二分查找的基础,我们已经有了一个排好序的元素列表，我们就需要知道如何来快速的排序,如何从列表中找到特定的元素。
-
I'm narrowing it down. It's getting a little silly but you know I'm going to really be persistent and just follow the rules here of binary search, rather than jumping to conclusions.
按照二分法的规则来做的,而不是直接得出某种结论,很明显这儿我的目的是什么？,显示这两个相同的东西。
-
But at the end of the day, and here's why we just went with binary and not decimal years ago, when you have one implement a computer with a physical device, it's actually really easy to represent the notion of on or off.
但是最终，之前我们采用二进制,而不是十进制，主要是因为当我们用一台实体机器运行计算机时，这实际上很容易用开或者关的概念来表示。
-
And it's called divide and conquer for the obvious reason. I'm going to divide it up into sub-problems with the hope that those sub-problems get easier. It's going to be easier to conquer if you like, and then I'm going to merge them back. Now, in the binary search case, in some sense, this is a little bit trivial.
因此被称为分治的原因就这么简单,将一个问题分解成一些子问题,并希望这些子问题解决起来比较方便,正如你希望的，求解的过程也会变得简单,下面就是把结果合并起来,现在，在二分搜索的例子里,从某些方面来说，这有点微不足道。
-
And a bit, B-I-T, just a shorthand for binary digit, 2 so a digit of zero over a one, bi means two, you only have two digits.
比特，B-I-T，是binary，digit的简写，从0到1的数字，而bi表示，所以你就只有两个数字。
-
Remember, we saw that last time looking at the binary numbers. 2 to the n is a big number.
还记得吗，我们上次看过的二进制数,从2到n是一个很大的数。
-
The way in which we put signs together is to take these bundles, these binary relationships between a concept and a sound image, and adjust them in an unfolding sequence.
我们随意地将能指和所指捆在一起，也就是构成了一个事物和声音形象的关系，而且他们能被排列成话语。
-
But let's look a little more carefully at the code for binary search-- for search 1.
二分搜索算法的代码,那么search，1，这个方法的。
-
So what would be the letter A in binary inside of a computer's memory when you hit the letter A on the keyboard, for capital A?
当你敲击键盘上的字母A时,那么在计算机二进制的存储中,字母A是什么样的呢？
应用推荐