RECURSION in Chinese translation

• 递归
• recursion

Examples of using Recursion in English and their translations into Chinese

The processing of these lists using recursion and Lisp functions like car and cdr is the power of list processing using Lisp.
使用递归和诸如car和cdr之类的Lisp函数处理这些列表是使用Lisp处理列表的强大之处。

But while using recursion, programmers need to be careful to define an exit condition from the function, otherwise it will go into an infinite loop.
但是在使用递归时，程序员需要谨慎确定函数的退出条件，否则会造成无限循环。

Until the last, N-th partition splits a into 0, 1, 1 item, and Quick Sort recursion stops.
直到最后，第N个分区将a分成0,1,1项，并且QuickSort递归停止。

If we further break down the expression T(n/4) and T(n/2), we get following recursion tree.
如果我们进一步分解表达T(n/4)和T(n/2),我们得到以下递归树。

The corresponding dynamic programming algorithm takes cubic time. The paper also points out that the recursion can accommodate arbitrary gap penalization formulas.
对应的动态规划算法需要立方时间。该报还指出，递归可容纳任意差距处罚公式：.

They also said,“of course, neural nets cannot do recursion,” and, at that time, recursion was regarded as the essence of intelligence.
他们还说：“当然，神经网络了做不了递归（recursion）”，当时，递归被认为是智能的本质。

If we get past both checks, then we know that n is positive or zero, so we can prove that the recursion terminates.
如果我们通过了这两个检查，那么我们知道\(n\)是一个正数或0，因此我们可以证明递归会终止。

A faster algorithm is the Levinson recursion proposed by Norman Levinson in 1947, which recursively calculates the solution.
一种更快的算法是NormanLevinson在1947年提出的Levinson递归法（en:Levinsonrecursion），它递归地计算方程的解。

Since we can have indefinitely deep recursion of sentential complements, the gap can be embedded indefinitely far inside the whole sentence.
因为我们可以无限加深句子补语的递归，在整个句子中缺口可以无限远的被填充。

This limit prevents infinite recursion from causing an overflow of the C stack and crashing Python.
因为无限递归会导致的C堆栈溢出和Python崩溃。

If a recursion never reaches a base case, it goes on making recursive calls forever, and the program never terminates.
如果一个递归永不会到达基础情形，它将永远进行递归调用，并且程序永远不会终止。

While we can unwind the recursion using our model of computation, it is often clearer to think about recursive calls as functional abstractions.
虽然我们可以使用我们的计算模型把递归展开，但是将递归调用视为函数抽象往往更为清晰。

Such a recursion causes the computer to execute a so-called"infinite" loop.
这样的递归将导致计算机执行一个“无限”循环。

But in Functional Languages, they are even more useful since there are no loop constructs just recursion.
但是在函数式（编程）语言里，它们甚至更有用，因为没有循环体只有递归。

Implementations are encouraged, but not required, to detect such recursion and reject promise with an informative TypeError as the reason.
我们推荐去实现,但不是必需的,检测这样的递归和通过一个异常TypeError来rejectpromise。

Now there are recursions in the language, butAnd you may not know that early programming languages did not support recursion.
现在的语言里面都有递归，然而你可能不知道，早期的程序语言是不支持递归的。

Restrict all code to very simple control flow constructs- do not use goto statements, setjmp or longjmp constructs, and direct or indirect recursion.
用非常简单的控制流结构体来编写程序-不要用setjmp或者longjmp结构体，goto语句，以及直接或间接的递归调用。

So I set about showing how you could do true recursion in a neural net.
所以我开始准备展示如何在一个神经网络中做真正的递归。

Assume that the recursion formula is correct up to step k- 1 of the algorithm; in other words, assume that rj= sj a+ tj b for all j less than k.
假设递归至第k-1步是正确的，也就是假设：rj=sja+tjb在j小于k時皆成立。

Companies with the same philosophy as Pharnext include technology giants like Google and IBM, as well as startups like Insilico Medicine, Recursion Pharmaceuticals, and BenevolentAI.
与Pharnext公司拥有相同理念的公司还包括像谷歌和IBM这样的科技巨头，以及像InsilicoMedicine，RecursionPharmaceuticals，和BenevolentAI这样的初创公司。