在 英语 中使用 Recursion 的示例及其翻译为 中文
{-}
-
Political
-
Ecclesiastic
-
Programming
But it's not recursion.
这不是recursion的。Recursion is actually another form of looping.
What is tail recursion?
Recursion has to have something already existing.
Take a look at Figure 7 to understand this recursion.
看一看图例7来理解这个递归。Recursion is used as a primary control structure.
将递归作为主要的控制结构。Typically indicative of very deep or unbounded recursion.
典型情况是指非常深和很大的递归。Recursion Specifies whether to act as a recursive server.
Recursion指定是否作为递归服务器使用。Suggests there's more recursion actually recurses.
这是因为我正在recursion，实际上recursion了很多。Recursion Pharmaceuticals is a biotechnology company based in Salt Lake City.
RecursionPharmaceuticals公司是总部设在美国盐湖城的一家新兴生物技术公司。Your function caused the following error: maximum recursion depth exceeded.
元件(导航)展现错误：maximumrecursiondepthexceeded。Apparently, Recursion Software is giving it another go.
显然，RecursionSoftware赋予了它其它的目的。This is a counting problem, not a construction problem,so we can approach it using recursion.
这是一个计数问题，而不是一个构造问题，所以我们可以使用recursion来处理它。Recursion Pharmaceuticals is an emerging biotechnology company based in Salt Lake City.
RecursionPharmaceuticals公司是总部设在美国盐湖城的一家新兴生物技术公司。The canonical name to denote the base case of the recursion is Nil, which announces the end of the list.
Again, use recursion based on the position of the tallest block, again say N is in position k from the left.
同样，使用基于最高块位置的recursion，再次说N在左边的位置k。We know that the number of rows in this diagram,also called the depth of the recursion tree, will be log( n).
我们知道图中的行的数目，也叫递归树的深度，将会是$log(n)$。It turns out that recursion is present, but not at the level of grammar but at the level of cognitive processes.
事实证明，递归是存在的，但是不在该水平的语法，但在水平的认知过程。A member of the NVIDIA Inception virtual accelerator program, Recursion is using deep learning to analyze biological images.
Recursion是NVIDIAInception虚拟加速器计划的一员，运用深度学习来分析生物影像。The recursion is bounded because in each recursive application either m decreases, or m remains the same and n decreases.
递归是有界的，因为在每次应用递归時，要么m递减，要么m保持不变而n递减。If the representation of object exposes a recursive entry,the recursive reference will be represented as<Recursion on typename with id=numbergt;.
如果object的表示形式公开了一个递归条目，该递归引用会被表示为<Recursionontypenamewithid=numbergt;。It avoids recursion, limits dynamic memory to configurable buffers and at no point stores an entire storage block in RAM.
它避免了递归，将动态内存限制为可配置的缓冲区，并且不需要将整个存储块存储在RAM中。The recursion goes down until it finds a non-list element, then extends the local variable flist and then rolls back it to the parent.
递归向下，直到找到非列表元素，然后扩展局部变量flist，然后将其回滚到父级。The recursion continues until there are no letters remaining in the word, when we store the intended value(in this case, the word dog).
递归继续直到词中没有剩余的字母，于是我们存储的了预期值（本例中是词chien）。Recursion, for instance, uses neural networks and other methods to analyse images of cells and learn how new drugs affect these cells.
Recursion运用了神经网络和其他方法，以分析细胞图像并学习新药如何对这些细胞产生影响。This recursion of architectures continues down to the most basic system elements: those that cannot be decomposed into less abstract elements.
这样的架构可以递归下去直到最基本的系统元素：它们不能再被分解为抽象层次更低的元素。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.
但在使用递归时，程序员需要注意定义一个从函数退出的条件，否则会进入无限循环。While Recursion primarily focuses on in-house drug development, it also works with pharmaceutical companies that want to screen a large set of compounds.
Recursion的主要重点虽是放在内部药物开发上，也能跟想要筛选大量药物的制药公司合作。Systems with explicit recursion combinators, such as Plotkin's PCF, are not normalizing, but they are not intended to be interpreted as a logic.
有明确的递归组合子的系统，比如GordonPlotkin的PCF，不是规范化的，但是它们不意图被解释为逻辑。Then, in July 2002, Recursion Software released JGL 4.0, integrating JGL collections and algorithms with the standard Collections Framework.
后来，在2002年7月，RecursionSoftware公司发布了JGL4.0版，并将JGL集合和算法与标准的CollectionsFramework集成。
