So, hopefully, if you were to go back and look you could see that this is, in fact, copper.

因此，我希望大家如果回去再看一遍,这个题目的话，能够知道这是铜原子。

麻省理工公开课 - 化学原理课程节选

Another good thing to do when you're really stuck is walk away. Take a break. Come back and look at it with fresh eyes of your own.

当你卡住的时候另外一件有益的事,就是走开休息一会儿,再回来看代码的时候你的眼睛就清醒多了。

麻省理工公开课 - 计算机科学及编程导论课程节选

Scholars of the Albright school pointed to texts and clay tablets that were discovered in second millennium sites. So you see down on the bottom the second millennium BCE, obviously going down to 1000; first millennium: 1000 to 0.

亚布莱特学院的学者们指的是,两千多年前的遗址中发现文件和泥板文献，你们看下面,公元前第二个千年，再显然的,往下到一千年；第一个千年是公元前1000年到公元元年。

耶鲁公开课 - 旧约导论课程节选

But at second glance we see that there is at least a possibility of, a logical possibility of surviving the death of my body.

但再看第二眼我们就会发现,至少还有一种可能，逻辑上来说还有一种,肉体死亡后复活的可能。

耶鲁公开课 - 死亡课程节选

"Dificil, eh?" means " Difficult, isn't it?") Alright. I have to see this one more time.

很难不笑，不是吗）,我要再看一遍。

哈佛公开课 - 幸福课课程节选

Everyone just stare at that a second, make sure I got it right.

大家再看一看我算得对不对

耶鲁公开课 - 博弈论课程节选

If you go down to 1s, it's 20 MJ per mole.

如果再往下看1s层，是一摩尔20兆焦耳。

麻省理工公开课 - 固态化学导论课程节选

So let's take a look then at somewhere where this is actually a useful thing to know so this is compare1.c. So, in compare1.c I've stripped out the comments in my version but in your version you do have comments for reference and it's actually pretty self-explanatory if you just read through the code.

那么再然我们看一看,一些有用的东西,这是compare1。c，所以在compare1。c中，在我的版本中,我吧注释去掉了,但是在你们的版本中是有注释的,这是相当容易理解的,如果你通读这段代码。

哈佛公开课 - 计算机科学课程节选

All right, I want to show you one last example of using recursion because we're going to come back to this. This is a classic example of using recursion. And that is dating from the 1200s and it is due to Fibonacci.

并且返回答案,我想给你看看递归的最后一个例子,因为我们还要再看一遍,这是一个递归的经典案例,它可以追溯到13世纪。

麻省理工公开课 - 计算机科学及编程导论课程节选

All right, well that's correct. So let's try and read that through.

正解,我们再从头到尾看一遍

耶鲁公开课 - 博弈论课程节选

All right. Let's look at this again more carefully.

我们再把这个论证更仔细地看一遍

耶鲁公开课 - 死亡课程节选

Knowing that, I'm going to say, OK, how many pigs are there, well that's just how we're, however many I had total, minus that amount, and then I can see, how many legs does that give, and then I can check, that the number of legs that I would get for that solution, is it even equal to the number of legs I started with, ah! Interesting. A return.

它将给我返回头的总数，知道了这些之后我可以说好了,有多少猪呢，无论有多少组鸡的数目，我只要用总数减去那个值,之后我就可以知道一共有多少条腿,然后再把这个值和题目中的腿数相比较，看它是否等于一开始的腿数,啊！真有趣，有一个返回值。

麻省理工公开课 - 计算机科学及编程导论课程节选

I'll get rid of Fibonacci here, we don't want to bother looking at that again.

我在这里会注释掉Fibonacci数，我们不想再看一遍。

麻省理工公开课 - 计算机科学及编程导论课程节选