And as long as that smaller computation reduces to another smaller computation, eventually I ought to get to the place where I'm down in that base case.

如果我不属于基础事件,那么我需要把它简化为更简单的计算，随着计算的不断简化,最终我能分解成基础事件。

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

But I want to stress again, as long as I do the base case right and my inductive or recursive step reduces it to a smaller version of the same problem, the code will in fact converge and give me out an answer.

就开心的去做吧,但是我想再次强调,只要基础事件处理正确而我的递归,或递推步骤能把它简化为更简单的同类问题,那么这段代码就可以收敛。

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

Now the bases, and you don't need to memorize the structures of these I'm going - I'm describing the whole molecule to you in its molecular detail and then we're going to simplify it down to a version that we can talk about more easily.

现在讲碱基,你不需要记住这些结构,我将给你们详述整个分子,的结构细节,然后我们把它简化为一个模板,使我们更容易讨论

耶鲁公开课 - 生物医学工程探索课程节选

I just reduced it to a smaller version of the same problem.

我刚刚把它简化为一个更小的同类问题,这就是我可以写出能解决更短字符串的例子。

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

I have used divide and conquer, as we seen before, to recursively break it into smaller problems. But the smaller problem of fib of 4 and the smaller problem of fib of 3 overlap with each other.

正如我们之前看到的，我已经进行了划分,并且递归性的把它分解为更小的问题,但是fib的简化问题,和fib的简化问题会相互重叠。

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