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

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

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

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.

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

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

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中，在我的版本中,我吧注释去掉了,但是在你们的版本中是有注释的,这是相当容易理解的,如果你通读这段代码。

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

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

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

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