What I have now is the following: I can write expressions, do combinations of things to get out values, I can store them away, I can print them up.

我已经讲过如下内容：,如何写表达式，如果把东西混合然后得到结果值，我可以将其保存，也可以将其显示。

麻省理工公开课 - 计算机科学及编程导论课程节选

And then we'll construct our tree as follows: each node, well, let me put an example here.

然后我们如下建立我们的决策树：,每一个节点，好的，让我们在这里举一个例子。

麻省理工公开课 - 计算机科学及编程导论课程节选

So you'll notice that I'm just going to put in numbers here and then the negative of the number and the numbers are roughly like this: . So the numbers are , , , , and .

你们会注意到我会先写一个正数,然后再写出它的相反数,收益大概如下,分别为,和

耶鲁公开课 - 博弈论课程节选

Well, I could look at the value here, and compare it to the value I'm trying to find, and say the following; if the value I'm looking for is bigger than this value, where do I need to look? Just here.

然后把它和目标数做个比较，然后做出如下的判断：,如果目标值大于这个值;,那么我应该去哪找呢？对，应该在这里,对不对？不可能在那儿。

麻省理工公开课 - 计算机科学及编程导论课程节选