递归 英语是什么意思 - 英语翻译

• recursive
• recursion
• recurrent
• recurse

在 中文 中使用 递归 的示例及其翻译为 英语

递归树/无环图.
The Recursion Tree/ DAG.

第一个问题是递归。
The first issue is devolution.

递归神经网络.
A Recursive Neural Network.

这时候就需要递归的帮助。
Help when transfer is needed.

递归神经网络.
A Recurrent Neural Network.

理解和应用递归的三个定律。
To understand and apply the three laws of recursion.

使用递归，我们可以保持变量的不可变性。
With recursion, we keep our variables immutable.

主定理主要来自递归树方法。
Master method is mainly derived from recurrence tree method.

有时递归背后的逻辑很难遵循。
Sometimes the logic behind recursion is hard to follow.

这类错误在使用递归时是很常见的。
This type of error is very common when working with recursion.

递归就是程序执行过程中自己调用自己的一种方法。
In recursion, a method invokes itself during its execution.

在后面的课程中，我们会见到其他的好处，例如递归。
In later lessons we will see other benefits like recursion.

递归神经网络（RNN），负责前瞻性思维。
A recurrent neural network(RNN) responsible for forward thinking.

这种“庞加莱递归定理”是现代混沌理论的基础。
This"Poincaré Recurrence Theorem" is the foundation of modern chaos theory.

递归神经网络有两个输入，现在和最近的过去。
A Recurrent Neural Network has two inputs, the present and the recent past.

Iframe元素上的srcdoc；必须进行解析和递归处理.
Srcdoc on iframe elements; must be parsed and recursively processed.

使用CASCADE选项可能使命令递归到其他用户所拥有的对象。
Using the CASCADE option may make the command recurse to objects owned by other users.

如果没有这样的终止条件，递归将会永远地继续下去。
Without such a termination condition a recursion would go on forever.

代表递归的终止条件（basecase）的规范名称是Nil，它宣布列表的终止。
The canonical name to denote the base case of the recursion is Nil, which announces the end of the list.

我们知道图中的行的数目，也叫递归树的深度，将会是$log(n)$。
We know that the number of rows in this diagram, also called the depth of the recursion tree, will be log( n).

由于算法是递归的，我们可以构建任何顺序的贝塞尔曲线：使用5个、6个或更多个控制点。
As the algorithm is recursive, we can build Bezier curves of any order, that is: using 5, 6 or more control points.

递归是有界的，因为在每次应用递归時，要么m递减，要么m保持不变而n递减。
The recursion is bounded because in each recursive application either m decreases, or m remains the same and n decreases.

这些网络被称为递归神经网络，它们能反向馈送到前几层或它们的层中的后续节点。
These networks are called recurrent neural networks, and they can feed backwards to prior layers or to subsequent nodes within their layer.

大型递归神经网络被用于学习输入字符串序列中的项之间的关系，然后生成文本。
Large recurrent neural networks are used to learn the relationship between items in the sequences of input strings and then generate text.

这个过程被称为递归解析，因为你必须来回询问不同的服务器，基本上是同一个问题。
This process is called recursive resolution, because you have to go back and forth asking different servers what's basically the same question.

有明确的递归组合子的系统，比如GordonPlotkin的PCF，不是规范化的，但是它们不意图被解释为逻辑。
Systems with explicit recursion combinators, such as Plotkin's PCF, are not normalizing, but they are not intended to be interpreted as a logic.

除了转发DNS请求和递归性质以外，还可以将多个服务器配置为某个特定域的“权威”DNS。
In addition to forwarding DNS requests and the recursive nature, you can also configure more than one server to be'authoritative' for a particular domain.

它避免了递归，将动态内存限制为可配置的缓冲区，并且不需要将整个存储块存储在RAM中。
It avoids recursion, limits dynamic memory to configurable buffers and at no point stores an entire storage block in RAM.

明天是属于机器学习、递归神经网络以及相似技术的，但是今天，长期建立的语言工程方法仍占上风。
Tomorrow belongs to deep learning- to recurrent neural networks and the like- but for today, long-established language-engineering approaches still prevail.

但是原始递归函数的集合不包含所有可能的可计算函数-这可以看作康拖尔对角论证法的变体。
However, the set of primitive recursive functions does not include every possible total computable function- this can be seen with a variant of Cantor's diagonal argument.