递归

基本解释 (translations)

recursion

与递归相关的网络例句 [注：此内容来源于网络，仅供参考]

The description methods of natural scenery was studied based on fractal, that is, recursive method, L-system method, IFS and IFS description method was put forward based on sine or cosine. This method overcomes angularity and consistency of recursive method, L-system method and IFS, and the variety of fractal sculpting consequence can be added and the basis for the later research and the application was provided.

对基于分形的描述自然景物方法，即递归洪、L-系统法、IFS法进行了分析研究，在此基础上，提出基于正余弦的IFS描述法，该方法克服了递归法、L-系统法、IFS法等描述方法的生硬性和一律性，增加了分形造型结果的多样性，为以后的深入研究和应用提供了依据。

Wang-type fuzzy logic system and its functional approximation ability are researched deeply, A class of Gauss-type fuzzy logic system is presented and studied What it defers from Wang-type fuzzy logic system is its using Gauss fuzzifier The analytical expression of this fuzzy logic system is derived detailed Its universal approximation theorem for nonlinear functions is proved by StoneWeiestrass theorem.

通过对两类模糊系统作为非线性辨识器的仿真研究显示出高斯型模糊逻辑系统在抗数据干扰方面比Wang型模糊系统有优势。对非线性动态系统的辨识问题，借助递归神经网络的研究成果，提出一种基于递归网络结构的自适应模糊逻辑系统和参数学习算法。

This is a square spiral design, its features are: recursive method used to run, using arithmetic progression method to run, using the recursive method and comparison method such as arithmetic functions.

详细说明：这是一个螺旋方阵的设计，它的功能有：用递归法来运行，用等差数列法来运行，用递归法和等差法进行比较等功能。

Firstly, based on natural gradient and nonlinear principal component analysis, a matrix equation is obtained by block recursive updating,and then the matrix equation is solved using QR factorization and back substitution to obtain the optimal separating matrix.

此外，结合自然梯度和非线性主分量分析提出了一种块递归的盲源分离方法，构造出按块递归更新的矩阵方程，然后用QR分解和回代法求解该矩阵方程得到最优分离矩阵。

After analyzing the structure of sentences,Tarski found that, it was impossible to define the truth of the calculus of classes directly,but making use of the structure character of sentential functions could give us the approach to escape the dilemma:Firstly,we could defined the concept of satisfaction in sentential functions by means of recursive method;Then,we could regard sentences as a peculiar form of sentential functions;Finally,with the help of the concept of satisfaction,we could defined successfully the truth of the calculus of classes.

通过分析语句的结构，塔斯基发现很难直接定义出类演算语言的真概念，而语句函项所具有的可递归形成的结构性质可以使我们得到脱离困境的办法：先采用递归方法针对语句函项定义出满足概念，然后把语句作为语句函项的特殊形式，借助于满足概念最终可以得到类演算语言的真概念定义。

We analyze low-dimension topology, present an general algebra expression of cubelike recursive interconnected function. All of these works provide a new method of studying cubelike recursive networks.

2分析研究了低维立方形递归网络的拓扑类型，给出了立方形递归网络互连函数代数表达式，为研究立方形递(来源：ABC论文d2网www.abclunwen.com)归网络给出了新方法。

Any partial results returned may not include all rows on recursion levels beyond the specified maximum recursion level.

所返回的任何部分结果都可能无法包括超过指定最大递归级别的递归级别上的所有行。

Keywords: Machine discovery,recursive function,primitive recursive formula,goal restraint.

递归函数法，该方法把待求函数本身作为唯一的理论项，从而保证了理论项的合适性；其发现能力也有所提高，该方法采用原始递归式定义函数，递归函数在理论上比较完善，故该方法具有很好的理论依据并且便于计算机实现。

Recursion algorithms are composed of initialization condition and recursion part, so they can he figured out with recursion equation.

递归算法由初始情况和递归部分组成，一般可以采用递归方程表示。

First,the determinant is regarded as a function of or- der n and denoted by D;Second,the determinant is expanded by row or by column,then the relation in both of Dand subdeterminants will be examined in details to set up certain a recursion,generally speaking,it must be a homogenous or a non homogenous recursion;fi- nally the coefficients of the general solution are found out with the aid.

给出了用递归关系方法求任意 n 阶行列式的值的一般方法：首先，把已知的 n 阶行列式看作为阶数 n 的一个函数，记为 D；其次，按行或按列展开这个行列式，并仔细观察存在于余子式及 D里的关系，建立关于 D的某一递归关系，此关系总为一个齐次的或非齐次的递归关系；最后，借助于 D(0)、D(1)和D(2)等求出递归关系的通解的系数。

与递归相关的网络解释 [注：此内容来源于网络，仅供参考]

recursive definition of domain：递归定义领域

递归定义 recursive definition | 递归定义领域 recursive definition of domain | 递归下降 recursive descent

recursive enumerability：递归可枚举性语言

recursive definition 递归定义 | recursive enumerability 递归可枚举性语言 | recursive equation 递归型方程

recursively enumerable set：递归可数集

recursive unsolvability 递归不可解性 | recursively enumerable set 递归可数集 | recursiveness 递归性

recursively enumerable set：递归可枚举集

递归定义变量 recursively defined variable | 递归可枚举集 recursively enumerable set | 递归可枚举语言 recursively-enumerable language

recursively enumerable：递归可枚举

递归函数 recursive function | 递归可枚举 recursively enumerable | 递归可判定 recursively decidable

partial recursive function：部分递归函数,局部递归函数,局部递归函数

partial recognition 部分识别,不完全识别 | partial recursive function 部分递归函数,局部递归函数,局部递归函数 | partial reduction 部分还原

recurrence formula：递归公式;循环公式

递归;循环;再归性 recurrence | 递归公式;循环公式 recurrence formula | 递归关系 recurrence relations

recursive function：递归函数

递归函数(recursive function)是一个自己调用自己的函数. 包括两种:直接递归和间接递归. 直接递归是指函数F的代码中直接包含了调用F的语句,而间接递归是指函数F调用了函数G,G又调用了H,如此进行下去,直到F又被调用.

recursive set：递归集,递归集合

recursive sequence 递归顺序,递归序列 | recursive set 递归集,递归集合 | recursive solution 递归解法

recursive estimation：递归估计,递推估计

recursive equation 递归型方程 | recursive estimation 递归估计,递推估计 | recursive function 递归函数