AbstractThis paper considers when one can invert general recursive operators which map a class of functions F to F. In this regard, we study four different notions of inversion. We additionally consider enumeration of operators which cover all general recursive operators which map F to F in the sense that, for every general recursive operator Ψ mapping F to F, there is a general recursive operator in the enumerated sequence which behaves the same way as Ψ on F. Three different possible types of enumeration are studied
AbstractIntuitively, the more a machine knows the more it can learn. This intuition is formalized in...
summary:Infinite lower triangular matrices of generalized Schröder numbers are used to construct a t...
AbstractGiven a program of a linear bounded and bijective operator T, does there exist a program for...
AbstractThis paper considers when one can invert general recursive operators which map a class of fu...
AbstractWe prove that all and only the invertible one-variable partial recursive dunctions can be ge...
Program inversion is a fundamental problem that has been addressed in many different programming set...
In this paper, we continue the work on the formal approach to program inversion by presenting progra...
This is an earlier presentation of part of /pubs/1992/159. The latter paper is also part of my PhD t...
AbstractThe paper presents a synthetic view of transformations that invert the order of evaluation o...
SETS, MODELS, AND PROOFS: TOPICS IN THE THEORY OF RECURSIVE FUNCTIONS David Roger Belanger, Ph.D. Co...
AbstractAn algebraic technique for reasoning about recursive programs is proposed. The technique is ...
AbstractThis paper gives a brief exposition of several recent results obtained by the authors concer...
AbstractIn the present paper the invertibility of multipliers is investigated in detail. Multipliers...
AbstractA general method is provided for enumerating sequences σ1σ2 … σn with respect to length, num...
This paper continues our earlier investigations into the inversion of random functions in a general ...
AbstractIntuitively, the more a machine knows the more it can learn. This intuition is formalized in...
summary:Infinite lower triangular matrices of generalized Schröder numbers are used to construct a t...
AbstractGiven a program of a linear bounded and bijective operator T, does there exist a program for...
AbstractThis paper considers when one can invert general recursive operators which map a class of fu...
AbstractWe prove that all and only the invertible one-variable partial recursive dunctions can be ge...
Program inversion is a fundamental problem that has been addressed in many different programming set...
In this paper, we continue the work on the formal approach to program inversion by presenting progra...
This is an earlier presentation of part of /pubs/1992/159. The latter paper is also part of my PhD t...
AbstractThe paper presents a synthetic view of transformations that invert the order of evaluation o...
SETS, MODELS, AND PROOFS: TOPICS IN THE THEORY OF RECURSIVE FUNCTIONS David Roger Belanger, Ph.D. Co...
AbstractAn algebraic technique for reasoning about recursive programs is proposed. The technique is ...
AbstractThis paper gives a brief exposition of several recent results obtained by the authors concer...
AbstractIn the present paper the invertibility of multipliers is investigated in detail. Multipliers...
AbstractA general method is provided for enumerating sequences σ1σ2 … σn with respect to length, num...
This paper continues our earlier investigations into the inversion of random functions in a general ...
AbstractIntuitively, the more a machine knows the more it can learn. This intuition is formalized in...
summary:Infinite lower triangular matrices of generalized Schröder numbers are used to construct a t...
AbstractGiven a program of a linear bounded and bijective operator T, does there exist a program for...