Most current approaches to linguistic structure suggest that language is recursive, that recursion is a fundamental property of grammar, and that independent performance constraints limit recursive abilities that would otherwise be infinite. This article presents a usage-based perspective on recursive sentence processing, in which recursion is construed as an acquired skill and in which limitat...

Naturally occurring speech contains only a limited amount of complex recursive structure, and this is re ected in the empirically documented di culties that people experience when processing such structures. We present a connectionist model of human performance in processing recursive language structures. The model is trained on simple arti cial languages. We nd that the qualitative performance...

SMT solvers have recently been extended with techniques for finding models in presence of universally quantified formulas in some restricted fragments. This paper introduces a translation which reduces axioms specifying a large class of recursive functions, including well-founded (terminating) functions, to universally quantified formulas for which these techniques are applicable. An empirical ...

We consider estimation procedures which are recursive in the sense that each successive estimator is obtained from the previous one by a simple adjustment. The model considered in the paper is very general as we do not impose any preliminary restrictions on the probabilistic nature of the observation process and cover a wide class of nonlinear recursive procedures. In this paper we study asympt...

Let A be a recursive structure, and let ψ be a recursive infinitary Π2 sentence involving a new relation symbol. The main result of the paper gives syntactical conditions which are necessary and sufficient for every recursive copy of A to have a recursive expansion to a model of ψ, provided A satisfies certain decidability conditions. The decidability conditions involve a notion of rank. The ma...

A number of recent papers present efficient algorithms for LTL model checking for recursive programs with finite data structures. A common feature in all these works is that they consider infinitely long runs of the program without regard to the size of the program stack. Runs requiring unbounded stack are often a result of abstractions done to obtain a finite-data recursive program. In this pa...

‎The first variable Zagreb index of graph $G$ is defined as‎ ‎begin{eqnarray*}‎ ‎M_{1,lambda}(G)=sum_{vin V(G)}d(v)^{2lambda}‎, ‎end{eqnarray*}‎ ‎where $lambda$ is a real number and $d(v)$ is the degree of‎ ‎vertex $v$‎. ‎In this paper‎, ‎some upper and lower bounds for the distribution function and expected value of this index in random increasing trees (rec...

This paper develops the Bayesian model selection based on Bayes factor for a rich class of partially-observed micro-movement models of asset price. We focus on one recursive algorithm to calculate the Bayes factors, first deriving the system of SDEs for them and then applying the Markov chain approximation method to yield a recursive algorithm. We prove the consistency (or robustness) of the re...

In this paper, a model-based approach to pel-recursive motion estimation is presented. The derivation of the algorithm is similar to the Wiener-based pel-recursive motion estimation algorithm. However, the proposed algorithm utilizes the spatiotemporal correlations in an image sequence by considering an autoregressive model for the motion compensated frames. Therefore, depending on the support ...

In this paper we show that Shannon’s General Purpose Analog Computer (GPAC) is equivalent to a particular class of recursive functions over the reals with the flavour of Kleene’s classical recursive function theory. We first consider the GPAC and several of its extensions to show that all these models have drawbacks and we introduce an alternative continuous-time model of computation that solve...