And the reason I want to show you this is to notice that the recursion can be doubled.

如果我来写斐波那契数列你可以看看这儿,原因是我想让你看看这部分的递归可以翻倍。

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

So you can imagine that this is a very powerful mechanism. So let's look what happens when I run-- start to run this.

因此你可以想到这是一种很强大的机制,让我们看看让我开始运行,这个程序的时候会有什么结果。

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

I'll even tell you what it is ahead of time.

我甚至可以让你预先看看是哪些话。

耶鲁公开课 - 心理学导论课程节选