-
And if all this goes together rapidly, I'm really confident that the problem will be fixed."
VOA: standard.2010.04.28
-
Well, that problem was partly solved by saying, 'Well,if I'm giving the inoculation to one person, and that's what would happen.
这个问题一定程度上可以这样解决,如果我给一个人接种,然后就可以解决了
-
because I'm sure you have a problem in your country as well.
因为你们国家肯定也有此类问题。
-
"I'm personally very convinced there eventually will be a solution to the Greek problem.
VOA: standard.2010.02.26
-
It implies that this algorithm is calling itself again and again, and again, and on each time the size of the problem I'm trying to sort is being divided by what?
这就说明此算法会一次又一次地调用自己,每次我要排序的问题规模大小,会除以多少呢？
-
No problem. Got to go.I'm double-parked. O.K. Thanks.
VOA: standard.other
-
That doesn't solve the problem we had before though Then I'm going to append it, and keep the last change for future use.
这样没有解决我们之前的问题,所以我要给它加上一个值，让上一次的变化能够用到未来的例子中。
-
So that way you can have an idea if, oh, I do really understand this but I'm a little bit slow, maybe I need to practice this one type of problem a little bit longer so I can get up to speed so I'm going to be able to get through all this in terms of the exam time.
这样你就可以知道，假设，噢，我真的懂这个，但是我的速度有点慢，或许我需要在练习这个类型的题目上,多花一点时间,这样我就可以提高自己的速度,可以全部做完,在考试规定的时间内。
-
I'm going to give the last class a problem which is pretty interesting, which is what happens to you when you have an elevator.
我将讲解最后一个例题,非常有趣,也就是当你在电梯里的情形
-
I'm thinking of the general problem of the abstraction of virtue, an abstract notion of virtue. Think of all the questions that all of us at some point or other tend to associate with virtue.
我在思考贞操这个抽象概念，贞操这一抽象的概念，想想所有那些,我们时不时的会由贞操想到的问题。
-
One other very important thing to understand about this defensive problem and this is one of the debatable issues between the old guard and the traditional interpretation; I'm still giving you the traditional view.
对于防御的问题还有另外一个很重要的因素,这也是老顽固们对传统观点,争论的一个话题,我还是采用传统观点的说法
-
I wanted to mention in this context, because I'm emphasizing how banks help solve the adverse selection and moral hazard problem -I wanted to mention briefly here also the rating agencies, which fulfill some of these functions.
我早就想在这段内容里讲讲这事了,因为我一直强调,银行是如何帮助解决逆向选择,以及道德风险问题的...,我还一直想在这里简要的提下,本应履行这些职能的那些信用评级机构
-
So it's not, as I say altogether straightforward to see how the answer " "Death is bad for me, because when I'm dead I don't exist" how that answers the problem as opposed to simply focusing our attention on the problem ? How can nonexistence be bad for me?
所以这并不是，就像我说的,那么简单可以领会到这个答案,“死亡对我来说不好，因为我死了我就不存在了“,如何回答了这个问题,和我们仅仅把关注点放在问题本身相反,不存在怎么可能对我来说有坏处呢？
-
Actually my problem is I'm sometimes too creative.
事实上，我的问题是我有时太有创意了。
-
That doesn't mean it's better, it just means that I'm making up for a problem that he created.
这不是说我讲得更好，而是帮他完成,遗留下来的问题。
-
Which may take up some arbitrary amount of memory. In that case, I'm back to this problem.
然后将接下来的每一个内存块设置为,指向数组对应元素值的指针。
-
Because I'm cutting down the problem in half at each time. You're right, but there's something we have to do to add to that, and that's the last thing I want to pick up on.
但是我们还需要强调一点,这是我最后想讲的一点,让我们来看看代码-实际上，让我们先来测试测试吧。
-
So I'm not suggesting that it's an optional problem set that you shouldn't do.
一个可做可不做的问题集,因为不做它你会后悔的。
-
I'm going to let t of b be the number of steps it takes to solve the problem of size b.
我会设立一个t作为,计算指数为b的时候解决问题需要的步骤数。
-
I'm just repeating the problem.
我现在还只是在重复问题。
-
I've certainly written code that has this problem, I've tried to use my own code that has this problem, and good to us, right, good hygiene, I'm going to use that word again here, of getting into the habit of writing defensive code up front, it's part of that collection of things that you ought to do is a great thing to do.
我举手了吧？,我当然写过犯这种错误的程序了,我也尝试过应用含有这种错误的代码，不错，好的卫生，我还是要用这个词,对我们有帮助，养成写防卫性,代码的好习惯，是你应该做的,一系列事情之一,也是我们日后要做的主要的事情。
-
With this, if I can assume that accessing the i'th element of a list is constant, then you can't see that the rest of that analysis looks just like the log analysis I did before, and each step, no matter which branch I'm taking, I'm cutting the problem down in half.
读取数组中的第i个元素,是个常量时间的操作的话，我也就能像以前那样得到,这个算法是对数级复杂度的分析,并且每一步不管我选择哪个区间，我都可以把问题的规模缩小一半。
-
I'm thinking about a problem, I'm going to show you an example in a second, first thing I'm going to do is say, what is the thing that's going to change every time I run through the same set of code?
我要解决一个问题，我马上会让大家看一个例子，第一件我要做的事情就是,弄明白每次运行同样的指令集时,每次都会改变的东西是什么？
-
This should all sound incredibly familiar, like I'm just repeating myself in terms of photoelectric effect, because essentially that's what I'm doing, and that's one reason we spent so much time and did so many problem-set problems on the photoelectric effect.
这应该听起来极其熟悉，就像我在重复自己在讲光电效应时所说的话，因为基本上我正是在这样做，这也是我们在光电效应这个问题上,花这么多时间,做这么多习题的原因之一。
-
Problem Set One will be posted on the course's website tonight by 7:00 p.m. It will very clearly walk you through the week's challenges.
习题集1今晚7：00，将在课程的网站上贴出来,它将非常清晰地带领你们,通过这个星期的挑战。
-
If I'm basically just squeezing jello, that is, I'm trying to make the problem simpler, but the combination turns out to be really complex, I've not gained anything.
如果我只是简单的挤压果汁，那么我是在尝试着让问题变得简单，但是合并过程就真的比较复杂,我得不到任何东西。
-
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.
但是这就是我对它的观点,如果我试着去以迭代的方式,解决一个问题的话,下面是我应该采取的步骤,第一件要做的事情。
-
That in many cases, I can gain efficiency if I'm willing to give up space. Having said that though, there may still be a problem, or there ought to be a problem that may be bugging you slightly, which is how do I guarantee that my hash function takes any input into exactly one spot in the storage space?
普遍存在的增益和权衡,在许多的例子中,可以通过牺牲空间而得到效率方面的增加,话说回来，仍然存在一个问题,或者应该会有一个问题困扰着你,就是我如何保证我的哈希函数能够准确将,任一输入映射到相应的唯一的存贮空间中去？
-
Log n Log n, because at each stage I'm cutting the problem in half. So I start off with n then it's n n/2 n/4 n/8 over two n over four n over eight.
因为总共有多少层？,因为在每一层，我都是把问题分解成两半,因此以n开始，然后是。
-
If I'm running at nanosecond speed, 1000 n, the size of the problem, whatever it is, is 1000, and I've got a log algorithm, it takes 10 nanoseconds to complete.
如果这个问题的规模，也就是n，是，如果这个问题是对数级的，这将会占据10纳秒的时间，你一眨眼的时间。
应用推荐