Sentence examples for recursive term from inspiring English sources

Of particular interest, our research has also demonstrated that the inclusion of a recursive term in a linear regression model will have no impact on its predicted output.

This theory is formulated over the language \(\mathcal{L}_a \cup \{F x)\}\) supplemented with terms for all closed primitive recursive functions and contains the statement \(\neg F \tau \) where \ \tau\) is some fixed primitive recursive term intended to denote an 'infeasible' number such as \(10^{12}\).

For instance, if we consider the super-exponential function \(2 \Uparrow 0 = 1\) and \(2 \Uparrow (x+1) = 2^{2 \Uparrow x}\) and let \ \tau\) be the primitive recursive term \(2 \Uparrow 2^k\), it is a consequence of Parikh's result that any proof of a contradiction in \(\mathsf{PA}^F\) must be on the order of \(2^k\) steps long.

One favored solution to this problem consists in neglecting recursive terms in the gradient calculation, an approximation which is not always without consequences on the convergence performance.

For distinct poles, the recursive terms in the complete partial fraction expansion of Eq. 9.2) can be realized as a parallel sum of complex one-pole filter sections, thereby producing a parallel complex resonator filter bank.

However, it can exploit temporal signal correlation effectively, as we shall show in Section 4. By choosing the tuning parameters to balance the bias and noise components of the recursive and non-recursive terms, very good performance can be achieved with a low computational complexity.

This represents the recursive condition.

We present an efficient recursive algorithm, termed Matching-Minimization algorithm, to compute the sample mean of a set of spike trains.

To probe the structural characteristics influencing on the SAR, the classification model was generated using a binary QSAR approach termed recursive partitioning (RP) analysis.

The evolution equation of E n is a recursive equation in terms of n, and is linear.

Fontaine exploits the counterintuitive nature of probabilities to show how choice could serve a complex recursive function in terms of process.