"Every time Americans debate the problem of states' rights, the relationship of federal power to state power -- which we are indeed having a roiling debate again -- and every time we debate not only race relations, but the very idea of what it means to be an American, multi-racial,greatly diverse society, we are debating the direct legacies of the Civil War."
VOA: special.2011.04.09
There's almost a danger here in listening to it too long or describing it in too much detail and the danger seems or what Milton thinks of as the peril seems to involve the problem of time.
听太久的话几乎都会有危险,描写过细的话,又会花费很多时间。
So we left off last time with looking at a bit of coding and teasing you with the upcoming problem set.
我们上次讲到了查看一些代码,并且给你们带来这下面的习题。
Bosworth said the problem will take time to solve. "This is not the first we have heard of HEU,".
VOA: standard.2009.09.06
And we hope that at the end of the class, every time you're confronted with some technical problem, one of your first instincts is going to be, "How do I write the piece of code that's going to help me solve that?"
并且我们希望到了期末,每当你要面对一些,技术问题的时候,你们的本能之一将会是:,“我怎么才能编写一个代码,来帮我解决这问题?“
"I think a solution to end this piracy, or to reduce it significantly, is possible and it should be done with cooperation of the local community, while at the same time addressing the root causes of the problem,".
VOA: standard.2009.10.30
So the problem of existence through time,or persistence through time, shouldn't be called the problem of personal identity,but just the problem of identity.
所以积年累月下来存在的问题,就不该叫做个人认同感的问题,而仅是认同感的问题。
Saying the United States is the only advanced democracy and only wealthy nation that allows such hardships for millions of its people, the president said the time has come to put politics aside and solve the problem.
VOA: standard.2009.09.10
So, just, if you can take what I'm saying for a moment right now that in fact this should collapse in this very small time frame, we have to see that there's a problem with one of these two things, either the Coulomb force law or Newtonian mechanics. So, what do you guys think is probably the issue here?
所以如果你们考虑我,开始说的这个塌缩应该,发生在很短的时间里,那么这两者之一就有问题,要么是库伦定律,要么是牛顿力学,你们觉得应该是哪个的问题?
It literally halves the amount of time it takes to solve that problem but we can actually do better.
它能把解决问题时间的缩短一半,但其实我们能做的更好。
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?
这就说明此算法会一次又一次地调用自己,每次我要排序的问题规模大小,会除以多少呢?
Typical characterization, not all the time, but typical characterization, is an algorithm that reduces the size of a problem by one, or by some constant amount each time, is typically an example of a linear algorithm.
我们学习过了线性算法,它的典型特征,不是通用的,但是比较典型的特征是,它是逐一减小问题的大小的,或者说是每次减小常数的大小。
If this was a class in which we were going to worry about the general problem of identity across time, this would be a problem we'd have to directly face.
如果我们要讨论的是,贯穿时间的,质的总的问题,我们就需要,直面这个问题。
But since we are only looking at enough of the problem of identity to get to the question that we really want to think about, the nature of personal identity across time, I'm not going to pursue that.
但由于我们只是,通过质的问题,来讨论,我们真正关注的问题,也就是贯穿时间的人格同一性,所以我不讨论那些。
Taking the problem, recognizing that you know what, 8 even though this is a pretty big problem size 8 in this case and last time it was size 8 or in the case of the papers in size of a thousand roughly with the phonebook, I assume these are in a perfectly straight line they won't quite fit.
以这个问题为例,你们要认识到,在这种情况下,这是个比较大的问题,其大小是,上次它的大小也是8,但在纸片那个问题中,电话簿的规模大概是上千的,现在假设这些,杯子完全在同一条直线上,虽然并不十分符合这个条件。
Well, realize one of the themes in this course and really one of the themes in programming and solving any problem with a machine is going to be really to just take small bites one at a time out of these problems until the end result ultimately is that you've actually bitten off a fairly large fairly interesting problem and in the aggregate, you've actually implemented something pretty sophisticated.
好吧,让我们先想一下这件事带给我们的主题,编程和解决问题的思想,一台机器最开始只会一步一个脚印,沿着要解决的问题向前迈进,直到最终的结果出来,最后你会发现,你已经解决了一个相当大,相当有趣的问题,而这个问题在最初看起来确是相当复杂的。
So the running time of the problem where the input is T of size N as expressed here formulaically, T of N, the running time of an algorithm, given an input of size N. You know what?
因此一个输入为N的问题的运行时间,在这儿的公式表示为,如果输入为N,那么此算法的运行时间,是多少呢?
应用推荐