We question the need for recursion in human cognitive processing by arguing that a generally simpler and less resource demanding process – iteration – is sufficient to account for human natural language and arithmetic performance. We claim that the only motivation for recursion, the infinity in natural language and arithmetic competence, is equally approachable by iteration and recursion. Secon...

for solving large sparse non-hermitian positive definite linear equations, bai et al. proposed the hermitian and skew-hermitian splitting methods (hss). they recently generalized this technique to the normal and skew-hermitian splitting methods (nss). in this paper, we present an accelerated normal and skew-hermitian splitting methods (anss) which involve two parameters for the nss iteration. w...

Multi-exit iteration is a generalization of the standard binary Kleene star operation that allows for the specification of agents that, up to bisimulation equivalence, are solutions of systems of recursion equations of the form X1 def = P1X2 + Q1 .. Xn def = PnX1 + Qn where n is a positive integer, and the Pi and the Qi are process terms. The addition of multi-exit iteration to Basic Process Al...

This paper will concentrate on contributions of CWI to the development of parallel Runge-Kutta (RK) methods. We shall describe two approaches to construct such methods. In both approaches, a conventional implicit RK method is used as a corrector equation whose solution is approximated by an iterative method. In the first approach, the iteration method uses a fixed number of iterations without s...

In this paper, He's highly prolic variational iteration method is applied ef-fectively for showing the existence, uniqueness and solving a class of singularsecond order two point boundary value problems. The process of nding solu-tion involves generation of a sequence of appropriate and approximate iterativesolution function equally likely to converge to the exact solution of the givenproblem w...