What is the translation of " RECURSIVE FUNCTION " in Chinese?

• 递归函数

Examples of using Recursive function in English and their translations into Chinese

You must write a recursive function.
因为要写的是一个recursivefunction.

Recursive functions make the code look clean and elegant.
递归功能使代码看起来干净优雅。

Then\(F\) is a recursive function.
那么f{\displaystylef}就是一个连续的函数。

The trick to doing this is to recognize that you can represent the gradient as a recursive function.
这么做的技巧就是意识到你可以把梯度表示为一个递归函数。

Definition- What does Recursive Function mean?
求翻译：Recursiverole是什么意思？?

This means a recursive function definition cannot be used as the M with let.
这意味着递归函数定义不能以let来使用M。

I write it out as a recursive function.
因为要写的是一个recursivefunction.

Following is another example which generates the Fibonacci Series for a given number using a recursive function.
以下是另一个例子，其给定参数产生斐波串联使用一个递归的函数：.

The set of primitive recursive functions is known as PR in complexity theory.
原始递归函数的集合在计算复杂性理论中叫做PR。

For example, if g and h are 2-ary primitive recursive functions then.
例如，如果g和h是二元原始递归函数，则.

And, when writing recursive functions, users of theorem provers have a strong urge to eliminate ill-foundedness.
而且，在编写递归函数时，定理证明器的用户有强烈的欲望去消除不良的根源。

In the above example, calc_factorial() is a recursive function, as it calls itself.
在上面的示例中,calc_factorial()是一个递归函数,因为它调用自己。

Write a recursive function lookup(trie, key) that looks up a key in a trie, and returns the value it finds.
写一个递归函数lookup(trie,key)在查找树中查找一个关键字，返回找到的值。

If you want to keep state for a while and every now and then modify it, you write a recursive function.
如果你想保存某个状态并且想每隔一段时间就去修改它，你可以写个递归函数。

Primitive recursive functions tend to correspond very closely with our intuition of what a computable function must be.
原始递归函数意图紧密对应于我们直觉上可计算函数应该的样子。

If you want to keep state for a while and every now and then modify it, you write a recursive function.
如果你需要保存一个状态一段时间，并且时不时的修改它，那么你可以编写一个递归函数。

Recursive functions do not use any special syntax in Python, but they do require some effort to understand and create.
递归函数在Python中不使用任何特殊的语法，但它们需要一些努力才容易理解和创建。

The Ackermann function"A"("m","n") is a well-known example of a total recursive function that is not primitive recursive..
阿克曼函数A(m,n)是周知的不是原始递归的全递归函数。

This means that when a recursive function calls itself, local variables in each instance of the function are given distinct addresses.
即递归函数调用自己时，局部变量的每一份实例都在不同的地址空间中。

A normal form theorem due to Kleene says that for each k there are primitive recursive functions U( y){\displaystyle U(y)\!}!
范式定理源于Kleene声称对于每个k有原始递归函数U(y){\displaystyleU(y)\!

However, not every μ-recursive function is a primitive recursive function- the most famous example is the Ackermann function..
但不是所有递归函数都是原始递归函数--其中最著名的是阿克曼函数。

This means that you can use the extern keyword to define a function before you use it(this is also useful for mutually recursive functions).
这意味着我们可以在使用函数之前使用'extern'关键字定义一个函数（这对于相互递归的函数也很有用）。

However, not every μ-recursive function is a primitive recursive function- the most famous example is the Ackermann function..
但是，不是所有递归函数都是原始递归函数-最著名的这种函数是阿克曼函数。

Setting max_stack_depth higher than the actual kernel limit will mean that a runaway recursive function can crash an individual backend process.
把max_stack_depth参数设置得高于实际的内核限制将意味着一个失控的递归函数可能会导致一个独立的后端进程崩溃。

How could you set up a recursive function so that a smart language/ compiler could evaluate the function and never run out of memory?
你会如何设置一个递归函数，好让真正的智能语言/编译器得以对函数求值，又不会耗尽内存？?

Early versions of JavaScript did not allow named function expressions, and for this reason you could not make a recursive function expression.
早期版本的JavaScript不允许使用命名函数表达式，出于这样的原因,你不能创建一个递归函数表达式。

With this version of Y we can go ahead and define other recursive functions(for instance, defining fibonacci as(Y almost-fibonacci)).
有了这个版本的Y我们就可以继续定义其他递归函数(比如，把fibonacci定义成(Yalmost-fibonacci))。

Certainly the initial functions are intuitively computable(in their very simplicity), and the two operations by which one can create new primitive recursive functions are also very straightforward.
当然函数的初始集合在直觉上是可计算的(因为它们非常简单)，而你能用来建立新原始递归函数的两个运算也是非常直接的。

A consequence of this result is that any μ-recursive function can be defined using a single instance of the μ operator applied to a(total) primitive recursive function.
这个结果的一个结论是任何μ-递归函数都可以使用把μ算子应用于（全）原始递归函数的一个单一实例来定义。