-
Successive approximation, Newton-Raphson was one nice example, but there's a whole class of things that get closer and closer, reducing your errors as you go along.
逐渐逼近,牛顿迭代是一个很好的例子,随着你不断的时行下去,你会不断的离结果越来越近，逐渐地减少误差。
-
And then I would reiterate this process using that as guess i, and do it again.
然后我会用这个猜想,继续迭代计算下去。
-
We used iterative deletion in a relatively abstract setting, or not abstract, rather a play setting last time in which were choosing numbers.
我们在相对抽象的背景下探讨迭代剔除,其实也没那么抽象,比如上一讲,我们做的选数字的游戏
-
Argc I'm iterating on the outside from I to Arg C, zero to Arg C; I on the inside, I better not use I; otherwise bad things are going to happen.
我从I迭代到Argc，从0迭代到;,在里面，我最好不是用;,否则坏事情将会发生。
-
And the right way to do it is not starting at the top, it's starting at the bottom.
而且正确的迭代不是,从头开始而是从尾开始。
-
What you can do is you can iterate keys, which gives you the keys in the dictionary, and then you can choose them, but there's no guarantee in the order in which you get keys.
你能做的就是迭代得到键，这样就可以得到字典中，所有的键并进行选择，但是键的顺序,是没有保证的。
-
We could do that; we could try iteratively deleting dominated strategies and see if that process converged.
可以尝试迭代剔除劣势策略,然后看看会不会趋向于某种结果
-
Which is iteration. Or loops.
也就是迭代，或者循环。
-
So if we do the procedure of iteratively deleting dominated strategies, going back again, looking what's dominated, all that's left is 5 and 6.
如果我们按照这个程序,迭代剔除劣势,不断回头看看那些策略是劣势的,最终将只剩下立场5和6
-
Again as I said this is my version of it, but you can see, every one of the examples we've used so far has that pattern to it.
形成了迭代的思想，我还是想用我的话，来表达表达，但是你们可以看到,我们讲过的每个例子都用到了这个模式。
-
This should be something familiar from when we were deleting dominated strategies.
这和我们之前学过的,迭代剔除劣势策略类似
-
So I'm going to build something that's going to do iterative exponentiation.
首先我会写一个,迭代乘法的过程。
-
In the case of a recursive exponentiator, I'm going to do the following trick.
在这个迭代求乘方的例子里面，我会用这么个小把戏。
-
They're running through a loop. It's a common way of thinking about problems.
有继承意义的迭代程序了,它们是以循环的模式来运行的。
-
Well, we would just delete the... We would iteratively delete dominated strategies.
我觉得我们可以,迭代剔除劣势策略
-
This process is called the "iterative deletion of dominated strategies."
这个过程被称之为,迭代剔除劣势策略
-
I think that's probably enough for iterative deletion.
我认为迭代剔除已经讲的差不多了
-
If I'm iterating from I on the outside, I on the inside, I'm going to start changing the value and I might very well induce an infinite loop but J is okay.
如果我在外面从I开始迭代，或从里面开始迭代，我将开始改变它的值,我可能引起一个无限循环，但是用J是可以的。
-
Again, what I want you to see is, notice the characteristic of that.
这里面的特征，也就是迭代产生了两个小一号的问题。
-
Because the right way to do it is iteratively.
因为正确的作法是迭代。
-
Iterative Deletion of Dominated Strategies.
迭代剔除劣势策略
应用推荐