Over the centuries,scientific thinkers worked to develop these devices and improve their accuracy and complexity.
VOA: special.2010.09.29
It is a form. It is a form and that form, because we can see it has structure and because we can see it has organization and complexity, is purposive.
它是一种形态,它之所以是一种形态,是因为我们可以看到它外在的形状,以及它复杂的结构,这就是“合目的性“
It's the vocabulary, it's the complexity of the thought, and so on that makes it difficult. Iser acknowledges this.
是词汇,思想的复杂性等等,使它变得难懂,伊瑟尔承认这一点。
He is being honored for his work on animal evolution and the origins of biological complexity.
VOA: special.2011.05.10
And to give you, again, a feeling for the complexity of these systems, the cerebellum contains approximately 30 billion neurons.
小脑包含大约三百万个神经元,这也能够让你再次体会到,这些系统的复杂性
"And that's what this method does - it captures the complexity of the puzzle and the interaction of all these genes together to produce exceptional longevity."
VOA: standard.2010.07.14
So in fact, over the next thirty or forty minutes we're going to show you a set of examples of sort of canonical algorithms, and the different classes of complexity.
在接下来的三四十分钟里面,我们将要讲一系列的,权威算法,以及不同种类的复杂度问题。
And if on the other side of complexity we can read simplicity and common sense, that's great.
而如果与复杂性相反,我们能看出简单性和常识,那就很好。
These ornate masquerades and charades that are part of his complexity reveal something about his identity.
这些华丽的化装舞会和猜谜游戏,揭露了他复杂个性中的一部分
This is a little game--and again, don't be overwhelmed by the complexity.
这是一个小游戏,不要被它的复杂性搞晕。
There's an extraordinary sense of verbal chaos, a kind of word hoard that modern poetry and modernism -generally, a kind of linguistic environment of great complexity from which modern poetry and modernism emerge.
这里关于口头言论的混乱有一种独特的理解,关于现代诗歌和现代性的隐藏理解,总之,是一种关于语言环境的庞大复杂性的理解,现代诗歌和现代性即是由此产生发展。
So, to confine the individual, it seems, to one and only one sphere of life would seem to do an injustice to the internal psychological complexity that makes each of us who we are.
所以,将个人约束在,唯一一个人生阶层之中似乎不公,因为忽视了,内心的复杂度,而这正是让我们每一个人显得独特的原因。
While there are only four different bases that make up either RNA or DNA, and so the complexity of an RNA polymer is limited.
在RNA或DNA的构成中,只含四种不同的碱基,因此一个RNA分子的复杂程度是有限的
Now you might say, wait a minute. Thing's ordered, if I stop part way through and I throw away half the list, doesn't that help me? And the answer is yes, but it doesn't change the complexity.
如果我在半路上停下来,然后不去遍历剩下的数组了,这会有帮助么?答案是有帮助,但这没法改变算法的复杂度,因为我们之前怎么说来着?
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?
让我再试一次这么说,我期望大家能通过,算法的复杂度,来看到算法的性能?
But I want you to take away from this how we reason about the complexity of these algorithms. And I'll remind you, we said we're going to mostly talk about time.
但是我想你们理解我们,是怎么推出这些问题的复杂度的,提醒大家,我说过了我们主要讨论时间问题。
So things that are good candidates for divide And conquer are problems where it's easy to figure out how to divide down, and the combination is of little complexity.
因为适合用分治算法解决的问题,最好是能够简单的将问题进行分解,并且合并的过程不是非常的复杂,只要比线性方案要小。
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.
一首好诗,的应该融合这些意象,尤其一首玄学诗,同时,这种复杂性,在现代文学,和文学批评中都十分重要。
And that is a preface to an idea of computational complexity we're going to come back to.
这是我们日后,要讲的计算复杂度的,一个前言。
That's an important observation, and as we get to the part of the course we talk about computational complexity, you'll see that what we really care about is not how efficient the program is on easy problems but how efficient it is on hard problems.
我们已经学习了这门课程的一部分了,我们要开始认识到,计算的复杂度这个概念,你会学习到我们在乎的并不是,算法在简单问题上的工作效率,而是解决复杂问题的效率。
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.
但是这里有个很重要的点,记得上节课,我提过在我们的代码中,有不同种类的复杂度,而且我还说了对于简单的分支程序,运行这种程序需要的总体时间,大体上,是和指令的数目相关的,因为每个指令只会被执行最多一次。
I've got to count my way down, which means that the access would be linear in the length of the list to find the i'th element of the list, and that's going to increase the complexity.
的位置并去访问,然后继续下去,也就意味着,找到数组中的第i个元素的方法,是关于数组的长度呈线性复杂度的,这回增加算法的复杂度。
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次方次,如果先排序后搜索。
The order complexity here, if I actually write it would be-- sorry, order n times m, and if m was equal to n, that would be order n squared, and this is quadratic.
如果m等于n的话,也就是n的平方,这是一个平方复杂度的问题,这是和前面不同类型的,好,我在做什么呢?
And then one of the things that I suggested was that if we could figure out some way to order it, and in particular, if we could order it in n log n time, and we still haven't done that, but if we could do that, then we said the complexity changed a little bit.
这就涉及到了排序,如果可以想出一种来将其进行排序,甚至可以在n,log,n的时间内完成,虽然目前我们没做这件事,但是一旦开始做这件事,那么复杂性就是发生一些变化。
And that's just a way of reminding you that we want to think carefully, but what are the things we're trying to measure when we talk about complexity here? It's both the size of the thing and how often are we going to use it? And there are some trade offs, but I still haven't said how I'm going to get an n log n sorting algorithm, and that's what I want to do today.
这只是在提醒你们我们要仔细的思考问题,但是当我们在讨论复杂性的时候,我们到底要衡量哪些东西?,是列表的大小和对其进行查找的频率吗?,这里面临一些取舍,但是我还没有说明,怎样得到一个n,log,n复杂度的排序算法,并且这是我今天想要讲的内容。
应用推荐