Unlike feedforward neural networks (FFNN) which can act as universal function approximaters, recursive neural networks have the potential to act as both universal function approximaters and universal system approximaters. In this paper, a globally recursive neural network least mean square (GRNNLMS) gradient descent or a real time recursive backpropagation (RTRBP) algorithm is developed for a s...

Introduction. The theory of regressive isols was introduced by J. C. E. Dekker in [7]. The results that we wish to present in this paper belong to this theory and is a continuation of some of our studies in [1], [3] and [4]. We will assume that the reader is familiar with the terminology and some of the main results of the papers listed as references. We let E denote the collection of all nonne...

We study strictly level-decreasing logic programs (sld-programs) as deened earlier by the present authors. It will be seen that sld-programs, unlike most other classes of logic programs, have both a highly intuitive declarative semantics, given as a unique supported model, and are computationally adequate in the sense that every partial recursive function can be represented by some sld-program ...

A recurrence is a recursive description of a function, usually of the form F : IN→ IR, or a description of such a function in terms of itself. Like all recursive structures, a recurrence consists of one or more base cases and one or more recursive cases. Each of these cases is an equation or inequality, with some function value f (n) on the left side. The base cases give explicit values for a (...

This paper introduces Farey Recursive Functions and investigates their basic properties. are a special type of recursive function from the rationals to commutative ring. The recursion these functions is organized by graph. They arise naturally in study 2-bridge knots links.

THE SYMBOLISM of language is, or may be, twofold. By far the greater portion of its recognized content and structure is symbolic in a purely referential sense; in other words, the meaningful combinations of vowels and consonants (words, significant parts of words, and word groupings) derive their functional significance from the arbitrary associations between them and their meanings established...

Macdonald defined two-parameter Kostka functions Kλμ(q, t) where λ, μ are partitions. The main purpose of this paper is to extend his definition to include all compositions as indices. Following Macdonald, we conjecture that also these more general Kostka functions are polynomials in q and t with non-negative integers as coefficients. If q = 0 then our Kostka functions are Kazhdan-Lusztig polyn...

List of Illustrations