Recursive Relations and-Recursive Functions

2000 ◽  
pp. 142-164
Keyword(s):  
Recursive Functions ◽  
Recursive Relations

Note on a conjecture of Skolem

1946 ◽  
Vol 11 (3) ◽  
pp. 73-74 ◽  
Author(s):  
Emil L. Post
Keyword(s):  
Recursive Function ◽  
Recursive Relation ◽  
Natural Numbers ◽  
Excellent Review ◽  
Recursive Functions ◽  
Diagonal Argument ◽  
Primitive Recursive ◽  
Recursive Relations

In his excellent review of four notes of Skolem on recursive functions of natural numbers Bernays states: “The question whether every relation y = f(x1,…, xn) with a recursive function ƒ is primitive recursive remains undecided.” Actually, the question is easily answered in the negative by a form of the familiar diagonal argument.We start with the ternary recursive relation R, referred to in the review, such that R(x, y, 0), R(x, y, 1), … is an enumeration of all binary primitive recursive relations.

Recursive Colorings of Highly Recursive Graphs

1981 ◽  
Vol 33 (6) ◽  
pp. 1279-1290 ◽  
Author(s):  
Henry A. Kierstead
Keyword(s):  
Characteristic Function ◽  
Computer Program ◽  
Finite Number ◽  
Natural Numbers ◽  
Recursive Functions ◽  
Explicit Constructions ◽  
Recursive Structures ◽  
Definition Of ◽  
Recursive Relations

One of the attractions of finite combinatorics is its explicit constructions. This paper is part of a program to enlarge the domain of finite combinatorics to certain infinite structures while preserving the explicit constructions of the smaller domain. The larger domain to be considered consists of the recursive structures. While recursive structures may be infinite they are still amenable to explicit constructions. In this paper we shall concentrate on recursive colorings of highly recursive graphs.A function f: Nk → N, where N is the set of natural numbers, is recursive if and only if there exists an algorithm (i.e., a finite computer program) which upon input of a sequence of natural numbers , after a finite number of steps, outputs . A subset of Nk is recursive provided that its characteristic function is recursive. For a more thorough definition of recursive functions and recursive relations see [10].

Preliminaries

2017 ◽  
Author(s):  
David J. Lobina
Keyword(s):  
Data Structures ◽  
Production Systems ◽  
Specific Data ◽  
Recursive Functions ◽  
Recursive Solution ◽  
Partial Recursive Functions ◽  
Recursive Structures ◽  
Recursive Data Structures ◽  
Recursive Data ◽  
The Relationship

Recursion, or the capacity of ‘self-reference’, has played a central role within mathematical approaches to understanding the nature of computation, from the general recursive functions of Alonzo Church to the partial recursive functions of Stephen C. Kleene and the production systems of Emil Post. Recursion has also played a significant role in the analysis and running of certain computational processes within computer science (viz., those with self-calls and deferred operations). Yet the relationship between the mathematical and computer versions of recursion is subtle and intricate. A recursively specified algorithm, for example, may well proceed iteratively if time and space constraints permit; but the nature of specific data structures—viz., recursive data structures—will also return a recursive solution as the most optimal process. In other words, the correspondence between recursive structures and recursive processes is not automatic; it needs to be demonstrated on a case-by-case basis.

State Estimation Using Randomly Delayed Measurements

1993 ◽  
Vol 115 (1) ◽  
pp. 19-26 ◽  
Author(s):  
A. Ray ◽  
L. W. Liou ◽  
J. H. Shen
Keyword(s):  
State Estimation ◽  
Minimum Variance ◽  
The State ◽  
Sensor Data ◽  
State Estimator ◽  
Uniform Asymptotic Stability ◽  
Simulation Experiments ◽  
State Estimate ◽  
Sampling Instant ◽  
Recursive Relations

This paper presents a modification of the conventional minimum variance state estimator to accommodate the effects of randomly varying delays in arrival of sensor data at the controller terminal. In this approach, the currently available sensor data is used at each sampling instant to obtain the state estimate which, in turn, can be used to generate the control signal. Recursive relations for the filter dynamics have been derived, and the conditions for uniform asymptotic stability of the filter have been conjectured. Results of simulation experiments using a flight dynamic model of advanced aircraft are presented for performance evaluation of the state estimation filter.

Algorithmic Logic with Recursive Functions

1981 ◽  
Vol 4 (4) ◽  
pp. 975-995
Author(s):  
Andrzej Szałas
Keyword(s):  
Completeness Theorem ◽  
Inference Rules ◽  
Partial Correctness ◽  
Recursive Functions ◽  
Algorithmic Logic ◽  
Block Structured

A language is considered in which the reader can express such properties of block-structured programs with recursive functions as correctness and partial correctness. The semantics of this language is fully described by a set of schemes of axioms and inference rules. The completeness theorem and the soundness theorem for this axiomatization are proved.

scholarly journals Recursive relations for a quiver gauge theory

2006 ◽  
Vol 2006 (10) ◽  
pp. 026-026 ◽  
Author(s):  
Jaemo Park ◽  
Woojoo Sim
Keyword(s):  
Gauge Theory ◽  
Quiver Gauge Theory ◽  
Recursive Relations
Sign in / Sign up

Export Citation Format

Share Document