Bournez and Hainry 2006 [Bournez, O. and E. Hainry, Recursive analysis characterized as a class of real recursive functions, Fundamenta Informaticae 74 (2006), pp. 409 433] used a function algebra to characterize the twice continuously differentiable functions of Computable Analysis, restricted to certain compact domains.
In[1], a class of systematic recursive convolutional encoders restricted to be of rate k/ k + 1) is proposed.
We have thus generated a class of partial recursive functions, namely those functions that can obtained from the initial functions by means of composition, primitive recursion, and least search.
A new class of recursive stochastic gradient algorithms designed for the k-medians loss criterion is proposed.
In this paper, a new class of recursive hybrid filtering structures is proposed for impulsive noise removal; the so-called recursive myriad-mean (RMyM) filters.
In this paper, we prove decidability of security (with respect to the standard Dolev Yao intruder) for a core class of recursive protocols and undecidability for several extensions.
Concretely, our main purpose is to prove that the Baire partial quasi-metricspace is a suitable mathematical framework for discussing by means of fixed-point argumentsthe asymptotic complexity of a general class of recursive algorithms to which the Hanoi,Fibonacci and all the algorithms analyzed in [4] belong.
Concretely,our main purpose is to prove that the Baire partial quasi-metric space is an appropriatemathematical framework for discussing via fixed point arguments the asymptotic complexityof a general class of recursive algorithms to which all the algorithms analyzed inCerdà-Uguet et al. (Theory Comput. Syst.
In other words, this undirected graph represents a non-empty class of recursive causal structures, which is in contrast to the graph previously discussed, which suggested features in the joint distribution that could not result from an acyclic SEM under the causal sufficiency assumption.
In this entry, we provide an account of the class of recursive functions, with particular emphasis on six basic kinds of recursion: iteration, primitive recursion, primitive recursion with parameters, course-of-value recursion, and double recursion.
