-
He says, "Poetry in our own time-- -- such is the complexity of the world we live in-- must be difficult."
他写道，“我们这一时代的诗-,正如我们生活着的世界-,让人费解“
-
What's the complexity of this decision tree solution? Well, in the worst case, we're enumerating every possibility of in and out.
决策树解决方法的复杂度是多少？,在最糟的例子中得列举，所有可能的输入和输出。
-
All of this has to be yoked together in the imagery of a good poem, particularly of a metaphysical poem, and this model of complexity is what matters both for modern literature and for literary criticism.
一首好诗,的应该融合这些意象，尤其一首玄学诗，同时，这种复杂性,在现代文学,和文学批评中都十分重要。
-
That Satan is still able to doubt the legitimacy of God's power is a testimony to the complexity, I think, of the analysis of power in Paradise Lost. No power, not even God's power, can be irresistibly and indisputably proven.
我认为，撒旦尚能怀疑上帝力量的正统性,就证明了，《失乐园》中对力量的分析的复杂性，即使是上帝的力量，也不能被不可抗拒，无可置疑的证明。
-
As we went from a company with $300 million to $3 billion to $60 billion, we had to put processes in place, for sure, to deal with the complexity of what we were trying to accomplish.
我们公司的资产由3亿美元,增加到30亿，600亿，所以我们应该有套程序，来处理这么复杂的情况,实现我们的目标。
-
And in this quest for what is best, positive psychology does not rely on wishful thinking, self-deception,or hand waving; instead,it tries to adapt what is best in the scientific method to the unique problems that human behavior presents " in all its complexity."
在追求理想状态时，积极心理学不会盲目主观，或自欺欺人;,相反，它尝试用最科学的方法来探究,极其复杂的人类行为所表现出来的,特殊问题“
-
But that's also nice, it lets you see how the recursive thing is simply unwrapping but the complexity in terms of the amount of time it takes is going to be the same.
它让我们看到了，在复杂度依照时间总数来看,没有变化的情况下,递归是怎么一步步的展开的,我欠你一个糖，谢谢。
-
So in fact, what does that suggest about the order of growth here? What is the complexity of this? Yeah. Logarithmic. Why?
复杂度是多少？,对的，对数级的么？，为什么呢？,学生：对数级的？
-
What's the complexity? I haven't talked to the side of the room in a while, actually I have.
我这里没有讲过这些,其实是有啦，这位同学帮我讲出来了。
-
I want you to recognize classes of algorithms and match what you see in the performance of the algorithm to the complexity of that algorithm. All right?
让我再试一次这么说,我期望大家能通过,算法的复杂度,来看到算法的性能？
-
Remember last time, I said that there's different kinds of complexity in our code, and I suggested for simple branching programs, the amount of time it takes to run that program is, in essence, bounded by the number of instructions, because you only execute each instruction at most once.
但是这里有个很重要的点,记得上节课，我提过在我们的代码中，有不同种类的复杂度，而且我还说了对于简单的分支程序,运行这种程序需要的总体时间,大体上，是和指令的数目相关的,因为每个指令只会被执行最多一次。
-
Right? If that was the case in that code, then my complexity is no longer log, because I need linear access for each time I've got to go to the list, and it's going to Lisp be much worse than that.
这里的复杂度不再是对数的了，因为每次在列表中，查找需要线性访问,可能还要糟糕,其实，有些编程语言，如。
-
In the linear case, meaning in the unsorted case what's the complexity of this? k times n, right? Order n to do the search, and I've got to do it k times, so this would be k times n.
复杂度是多少？k的n次方，对吧？,在序列n中做搜索，要做k次，所以是k的n次方次,如果先排序后搜索。
应用推荐