OK. I know. It looks boring. But it's a structure of the things I want to think about when I go through trying to take a problem and mapping it into a iterative program.

好，我知道这看起来有点无聊,但是这是我要去以迭代的方式,去解决一个问题采取的,措施的大致结构。

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

So I'm going to build something that's going to do iterative exponentiation.

首先我会写一个,迭代乘法的过程。

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

We used iterative deletion in a relatively abstract setting, or not abstract, rather a play setting last time in which were choosing numbers.

我们在相对抽象的背景下探讨迭代剔除,其实也没那么抽象,比如上一讲,我们做的选数字的游戏

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

The last point I want to make to you is, you've started writing programs that you would think of as being inherently iterative.

能反映递归特性的程序，我最后一点想说的是,你已经开始编写你认为。

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

OK. So last time around, we talked about, or introduced if you like, iterative programs.

好，上节课的最后时候，我们讲过了，或者是介绍过了。

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

Once you hear that description, it's easy to write the code, in fact. This is a place where the recursive version of it is much easier to think about than the iterative one.

实际上一旦你听到了大致描述,就能很轻松的写出代码来,在这一点上应用递归来解决问题,比用迭代要容易理解多了。

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

If I want to try and decide how to tackle a problem in an iterative matter, here the steps I'm going to go through. First thing I'm going to do, is I'm going to choose a variable that's going to count.

但是这就是我对它的观点,如果我试着去以迭代的方式,解决一个问题的话,下面是我应该采取的步骤,第一件要做的事情。

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

So if the only tool I taught you in this class was dominated strategies and the iterative deletion of dominated strategies we'd be stuck.

所以之前讲的,不要采用劣势策略,和迭代剔除劣势策略在这里就不奏效了

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

We saw some quadratic algorithms, typically those are things with multiple nested loops, or iterative or recursive calls, where you're doing, say, a linear amount of time but you're doing it a linear number of times and so it becomes quadratic, and you'll see other polynomial kinds of algorithms.

我们看过一些平方算法，他们一般进行了多次嵌套循环,或者递归迭代调用，对一个线性操作调用线性次,这样就变成平方次了,以后你们能看到,一些多项式算法。

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

So have I convinced you that there's something you can do with iterative deletion?

大家都理解,有关迭代剔除的内容了吧

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

This process is called the "iterative deletion of dominated strategies."

这个过程被称之为,迭代剔除劣势策略

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

I think that's probably enough for iterative deletion.

我认为迭代剔除已经讲的差不多了

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

Iterative Deletion of Dominated Strategies.

迭代剔除劣势策略

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

Whether it was recursive or iterative.

但是在这个问题里。

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

So what Christine is arguing is, even though it's the case that 2 is not a dominated strategy, if we do the process of iterative deletion of dominated strategies and we delete the dominated strategies, then maybe we should look again and see if it's dominated now.

克里斯汀说的是,即使选择立场2不是劣势策略,如果我们迭代剔除劣势策略,然后我们剔除掉了劣势策略,然后再来回头看看还有没有劣势策略了

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