Results 211 to 220 of about 26,685 (258)
Particle Filtering-Based In-Flight Icing Detection for Unmanned Aerial Vehicles. [PDF]
Sensors (Basel)Souanef T +4 more
europepmc +1 more source
Some of the next articles are maybe not open access.
Related searches:
Related searches:
Mathematical Structures in Computer Science, 1996
In this paper, we propose a new and elegant definition of the class of recursive functions, which is analogous to Kleene's definition but differs in the primitives taken, thus demonstrating the computational power of the concurrent programming language introduced in Walters (1991), Walters (1992) and Khalil and Walters (1993).The definition can be ...
Nicoletta Sabadini +2 more
openaire +1 more source
In this paper, we propose a new and elegant definition of the class of recursive functions, which is analogous to Kleene's definition but differs in the primitives taken, thus demonstrating the computational power of the concurrent programming language introduced in Walters (1991), Walters (1992) and Khalil and Walters (1993).The definition can be ...
Nicoletta Sabadini +2 more
openaire +1 more source
Accessible Recursive Functions
Bulletin of Symbolic Logic, 1999AbstractThe class of all recursive functions fails to possess a natural hierarchical structure, generated predicatively from “within”. On the other hand, many (proof-theoretically significant) sub-recursive classes do. This paper attempts to measure the limit of predicative generation in this context, by classifying and characterizing those ...
openaire +1 more source
Proceedings of IEEE 9th International Conference on Data Engineering, 2002
A complete and efficient implementation of linear, one-side recursive queries in Iris, an object-oriented database management system, is described. It is shown that recursion can be easily and efficiently added to a large class of existing database management systems.
Philippe De Smedt +4 more
openaire +1 more source
A complete and efficient implementation of linear, one-side recursive queries in Iris, an object-oriented database management system, is described. It is shown that recursion can be easily and efficiently added to a large class of existing database management systems.
Philippe De Smedt +4 more
openaire +1 more source
Splinters of recursive functions
Journal of Symbolic Logic, 1960Basic notation in this paper is as in [3]. From [5] and [9] the following additional notation is derived,ϕiis the partial recursive function with indexi, Wiits range. ∅ is the empty set. ‘≡’ denotes isomorphism between sets, ‘≡m’ many-one equivalence, ‘≡T’ Turing equivalence, ‘≦1’ and ‘≦m’ signify one-one and many-one reducibility respectively ...
openaire +2 more sources
Recursive subdivision and hypergeometric functions
Proceedings SMI. Shape Modeling International 2002, 2003We describe a method for efficient calculation of coefficients for subdivision schemes. We work on the unit sphere and we express the z-coordinate of all the existing points as power series in the variable cos /spl theta/. Any linear combination of them is also a power series in cos /spl theta/ and, by solving a linear system, we determine the linear ...
Ioannis P. Ivrissimtzis +2 more
openaire +2 more sources
1965
The concept of computable function was at first given intuitively (§ 2). We have, by virtue of an analysis of the behaviour of a calculator (§ 3), arrived at an exact definition of Turing-computability (§ 6). The direct connection with intuition, which is gained by this method, is without doubt a great advantage in realizing the meaning of the precise ...
openaire +1 more source
The concept of computable function was at first given intuitively (§ 2). We have, by virtue of an analysis of the behaviour of a calculator (§ 3), arrived at an exact definition of Turing-computability (§ 6). The direct connection with intuition, which is gained by this method, is without doubt a great advantage in realizing the meaning of the precise ...
openaire +1 more source
Origins of Recursive Function Theory
IEEE Annals of the History of Computing, 1979For over two millenia mathematicians have used particular examples of algorithms for determining the values of functions. The notion of "?-definability" was the first of what are now accepted as equivalent exact mathematical descriptions of the class of the functions for which algorithms exist.
openaire +2 more sources
Algorithmic Logic with Recursive Functions
Fundamenta Informaticae, 1981A language is considered in which the reader can express such properties of block-structured programs with recursive functions as correctness and partial correctness. The semantics of this language is fully described by a set of schemes of axioms and inference rules. The completeness theorem and the soundness theorem for this axiomatization are proved.
openaire +2 more sources