中英释义：
recurrencen.重现；重新提起；再发生；反复
recursionn.递归（在数学和计算机科学中指通过重复将问题分解为同类的子问题来解决问题的过程）
这个函数在递归中调用自身来处理数据。
The function calls itself in a recursion to process the data.
如果没有正确实现，递归可能会很难调试。
Recursion can be tricky to debug if not implemented correctly.
理解递归对于解决复杂问题是至关重要的。
Understanding recursion is essential for solving complex problems.
递归的概念通常用斐波那契数列来说明。
The concept of recursion is often illustrated with the Fibonacci sequence.
计算机科学中的许多算法依赖递归来提高效率。
Many algorithms in computer science rely on recursion for efficiency.
递归太深; 堆栈溢出.
Recursion too deep; the stack overflowed.
递归的另一个实例如下
Another example of recursion at work is the following
对给定的文法消除左递归.
To the grammar which assigns eliminates the left recursion.
对给定的文法消除左递归。
To the grammar which assigns eliminates the left recursion .
解释递归的概念,并阐释如何编写递归函数.
Explains the concept of recursion and illustrates how to write recursive functions.
所以呢？这表示每一个迭代都只是在尝试自我证明，这是递归，是没有意义的。
And? And that means each iteration is an attempt to prove its own proof. It's recursive. It's nonsensical.
《星际穿越》《Interstellar》
就是奇点，当系统能够实现递归的自我强化，当它能更好地进行自我校准扩张与繁殖速度都超过我们时，人类短暂的统治将不可避免地走到尽头。
The Singularity. When the system is capable of recursive self-improvement, when it is better at recalibrating, expanding and spawning than we are, the brief blip of humanity's reign will reach its inevitable conclusion.
《傲骨贤妻第七季》《The Good Wife Season 7》
