集合上的递归函数

本文在Ｊｅｎｓｅｎ和Ｋａｒｐ工作的基础上引进了集合上的递归函数的概念．研究了递归集函数的初步性质，讨论了递归集函数与Ｊｅｎｓｅｎ和Ｋａｒｐ定义的原始递归集函数及递归数论函数之间的关系，并给出了ＺＦＣ的可定义集模型上递归集函数的范式定理．     

The complexity of recursive constraint satisfaction problems

We investigate the complexity of finding solutions to infinite recursive constraint satisfaction problems. We show that, in general, the problem of finding a solution to an infinite recursive constraint satisfaction problem is equivalent to the problem of finding an infinite path through a recursive tree. We also identify natural classes of infinite recursive constraint satisfaction problems where the problem of finding a solution to the infinite recursive constraint satisfaction problem is equivalent to the problem of finding an infinite path through finitely branching recursive trees or recursive binary trees. There are a large number of results in the literature on the complexity of the problem of finding an infinite path through a recursive tree. Our main result allows us to automatically transfer such results to give equivalent results about the complexity of the problem of finding a solution to a recursive constraint satisfaction problem.     

并行准高斯高阶递归滤波算法研究

三维变分同化系统中一个重要的问题是背景误差协方差矩阵B及其逆的求解.背景误差协方差矩阵的水平变换部分采用递归滤波运算,可以简化矩阵的求解,解决了背景误差协方差矩阵B及其逆难以求解的问题.本文对准高斯高阶递归滤波的算法原理和过程进行了深入研究.因为递归滤波并行的低可扩展性制约了高阶递归滤波算法在三维变分同化系统中的应用,所以本文提出了阶段二维区域剖分并行化方法,实现了并行准高斯高阶递归滤波算法库.数值试验表明,四阶递归滤波1次的效果明显优于一阶4次的滤波效果;并且高阶递归滤波并行算法64核时能达到大约50倍的加速,并行效率高达78%,具有良好的加速效果和较强的可扩展性.     

Recursive computational formulas of the least squares criterion functions for scalar system identification

The paper discusses recursive computation problems of the criterion functions of several least squares type parameter estimation methods for linear regression models, including the well-known recursive least squares (RLS) algorithm, the weighted RLS algorithm, the forgetting factor RLS algorithm and the finite-data-window RLS algorithm without or with a forgetting factor. The recursive computation formulas of the criterion functions are derived by using the recursive parameter estimation equations. The proposed recursive computation formulas can be extended to the estimation algorithms of the pseudo-linear regression models for equation error systems and output error systems. Finally, the simulation example is provided.     

LIMITING BEHAVIOR OF RECURSIVE M-ESTIMATORS IN MULTIVARIATE LINEAR REGRESSION MODELS AND THEIR ASYMPTOTIC EFFICIENCIES

Recursive algorithms are very useful for computing M-estimators of regression coefficients and scatter parameters. In this article, it is shown that for a nondecreasing ul （t）, under some mild conditions the recursive M-estimators of regression coefficients and scatter parameters are strongly consistent and the recursive M-estimator of the regression coefficients is also asymptotically normal distributed. Furthermore, optimal recursive M-estimators, asymptotic efficiencies of recursive M-estimators and asymptotic relative efficiencies between recursive M-estimators of regression coefficients are studied.     

Provably total functions of Basic Arithmetic

It is shown that all the provably total functions of Basic Arithmetic BA, a theory introduced by Ruitenburg based on Predicate Basic Calculus, are primitive recursive. Along the proof a new kind of primitive recursive realizability to which BA is sound, is introduced. This realizability is similar to Kleene's recursive realizability, except that recursive functions are restricted to primitive recursives.     

Recursive and explicit rules: How can we build student algebraic understanding?

Differing perspectives have been offered about student use of recursive and explicit rules. These include: (a) promoting the use of explicit rules over the use of recursive rules, and (b) encouraging student use of both recursive and explicit rules. This study sought to explore students’ use of recursive and explicit rules by examining the reasoning of 25 sixth-grade students, including a focus on four target students, as they approached tasks in which they were required to develop generalizations while using computer spreadsheets as an instructional tool. The results demonstrate the difficulty that students had moving from the successful use of recursive rules toward explicit rules. In particular, two students abandoned general reasoning, instead focusing on particular values in an attempt to construct explicit rules. It is recommended that students be encouraged to connect recursive and explicit rules as a potential means for constructing successful generalizations.     

Recursive automorphisms of recursive linear orderings

We characterize by classical order type those recursive linear orderings L such that every classically isomorphic recursive copy R of L has a non-identity recursive automorphism.     

Endomorphisms of the group of all recursive permutations

We describe all endomorphisms of the group Aut_T ɛ of all recursive permutations. It is proved that the family of these endomorphisms is countable, and that they all are continuous and may be defined by some natural recursive operators. Orbits relative to the image of Aut_Tω prove to be recursive, and there exists a recursive model M such that this image is exactly its recursive automorphism group. There exists a universal endomorphism which contains, in a sense, all endomorphisms of that group. The universal endomorphism is unique with respect to some natural recursive equivalence. Supported by RFFR grant No. 093-01-01525. Translated fromAlgebra i Logika, Vol. 36, No. 1, pp. 54–76, January–February, 1997.     

General Constructions for Double Group Divisible Designs and Double Frames

We generalize the concept of an incomplete double group divisible design and describe some recursive constructions for such a generalized new design. As a consequence, we obtain a general recursive construction for group divisible designs, which unifies many important recursive constructions for various types of combinatorial designs. We also introduce the concept of a double frame. After providing a preliminary result on the number of partial resolution classes, we describe a general construction for double frames. This construction method can unify many known recursive constructions for frames.     

Asymptotic Normality of the Recursive M-estimators of the Scale Parameters

In this paper, the limit distributions of the recursive M-estimators of scatter parameters in a multivariate linear model setting are studied. Under some mild conditions, the asymptotic normality of the recursive M-esimtators is established. Some Monte Carlo simulation results are presented to illustrate the performance of the recursive M-estimators.     

Extension of partial recursive functions and functions with a recursive graph

It is proved that every degree of complexity of mass problems, containing the decision problem of a recursive enumerable set, contains also the problem of extension of a partial recursive function, the graph of which is recursive. Some properties of functions with a recursive graph are considered.Translated from Matematicheskie Zametki, Vol. 5, No. 2, pp. 261–267, February, 1969.The author is deeply indebted to V. A. Uspenskii for discussion of the results.     

Recursiveness of ω-Operations

It is well known that any finitary operation is recursive in a suitable total numeration. A. Orlicki showed that there is an ω-operation not recursive in any total numeration. We will show that any ω-operation is recursive in a partial numeration. Mathematics Subject Classification: 03D45.     

Primitive recursive analogues of regular cardinals based on ordinal representation systems for KPi and KPM

In this paper, we develop primitive recursive analogues of regular cardinals by using ordinal representation systems for KPi and KPM. We also define primitive recursive analogues of inaccessible and hyperinaccessible cardinals. Moreover, we characterize the primitive recursive analogue of the least (uncountable) regular cardinal.     

Stochastic optimization of forward recursive functions

This note solves a finite-horizon stochastic optimization problem with forward recursive criterion through dynamic programming. The forward recursive criterion is wide; it includes additive (discounted), multiplicative (discounted risk-sensitive), minimum and terminal criteria. The basic idea is to apply invariant imbedding method for the stochastic optimization. The method incorporates recursive accumulation process into dynamics by expanding the original state space.     

Automorphism groups of decidable models

It is proved that there exists no relationship between isomorphism types of the ordinary and recursive automorphism groups of recursive models and the property of being decidable for these models. Moreover, we show that all isomorphism types of recursive automorphism groups can be realized in a single (up to isomorphism) decidable countably categorical model. Taking account of the action of a group on the universe of the model makes it possible to distinguish between the classes of groups for decidable and all the recursive models.Translated fromAlgebra i Logika, Vol. 34, No. 4, pp. 437–447, July-August, 1995.     

Difference Sets and Recursion Theory

There is a recursive set of natural numbers which is the difference set of some recursively enumerable set but which is not the difference set of any recursive set.     

具有引导变量的多层递阶方法在黑龙江省哈尔滨市天气预报中的应用

对多层递阶基本问题做了简要的叙述,紧紧围绕多层递阶方法发展的两个新方向,即多模型、多算法的综合预报模式和带有引导变量模型的预报模式,并对其进行改进,利用改进后的模型和算法对黑龙江省哈尔滨市的月平均气温进行了具体的预报,预报的效果令人满意.     

HOPF ALGEBRAIC APPROACH TO THE n LINEARLY RECURSIVE SEQUENCES

ＨＯＰＦＡＬＧＥＢＲＡＩＣＡＰＰＲＯＡＣＨＴＯＴＨＥｎＬＩＮＥＡＲＬＹＲＥＣＵＲＳＩＶＥＳＥＱＵＥＮＣＥＳ￥ＬＩＡＮＧＧＵＩＡｂｓｔｒａｃｔ：Ｉｔｉｓｐｒｏｖｅｄｔｈａｔａｌｉｎｅａｒｌｙｒｅｃｕｒｓｉｖｅｓｅｑｕｅｎｃｅｏｆｎｉｎｄｉｃｅｓｏｖｅｒ...