Results 81 to 90 of about 150 (103)
Some of the next articles are maybe not open access.
Proceedings of the 2021 International Symposium on Symbolic and Algebraic Computation, 2021
Range functions are an important tool for interval computations, and they can be employed for the problem of root isolation. In this paper, we first introduce two new classes of range functions for real functions. They are based on the remainder form by Cornelius and Lohner [7] and provide different improvements for the remainder part of this form.
Kai Hormann, Lucas Kania, Chee Yap
openaire +2 more sources
Range functions are an important tool for interval computations, and they can be employed for the problem of root isolation. In this paper, we first introduce two new classes of range functions for real functions. They are based on the remainder form by Cornelius and Lohner [7] and provide different improvements for the remainder part of this form.
Kai Hormann, Lucas Kania, Chee Yap
openaire +2 more sources
Recursive Analysis Characterized as a Class of Real Recursive Functions
Fundam. Informaticae, 2006Recently, using a limit schema, we presented an analog and machine independent algebraic characterization of elementarily computable functions over the real numbers in the sense of recursive analysis. In a different and orthogonal work, we proposed a minimization schema that allows to provide a class of real recursive functions that corresponds to ...
Bournez, Olivier, Hainry, Emmanuel
openaire +3 more sources
Real numbers and functions in the Kleene hierarchy and limits of recursive, rational functions
Journal of Symbolic Logic, 1969Let ƒ be a real number. It is well known [7] that the set of rational numbers which are less than ƒ is a recursive set if and only if ƒ is representable as the limit of a recursive, recursively convergent sequence of rational numbers.
openaire +1 more source
Real-world computers and recursive function theory
Computers & Electrical Engineering, 1991zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire +1 more source
Prediction of Recursive Real-Valued Functions from Finite Examples
2006In this paper, we investigate prediction of recursive real-valued functions from finite examples by extending the framework of inductive inference of recursive real-valued functions to be a more realistic one. First, we propose a finite prediction machine, which is a procedure that requests finite examples of a recursive real-valued function h and a ...
Eiju Hirowatari +2 more
openaire +1 more source
[Proceedings 1988] 29th Annual Symposium on Foundations of Computer Science, 1988
A model for computation over an arbitrary (ordered) ring R is presented. In this general setting, universal machines, partial recursive functions, and NP-complete problems are obtained. While the theory reflects of classical over Z (e.g. the computable functions are the recursive functions), it also reflects the special mathematical character of the ...
L. Blum, M. Shub, S. Smale
openaire +1 more source
A model for computation over an arbitrary (ordered) ring R is presented. In this general setting, universal machines, partial recursive functions, and NP-complete problems are obtained. While the theory reflects of classical over Z (e.g. the computable functions are the recursive functions), it also reflects the special mathematical character of the ...
L. Blum, M. Shub, S. Smale
openaire +1 more source
Computable Real‐Valued Functions on Recursive Open and Closed Subsets of Euclidean Space
Mathematical Logic Quarterly, 1996Abstract In this paper we study intrinsic notions of “computability” for open and closed subsets of Euclidean space. Here we combine together the two concepts, computability on abstract metric spaces and computability for continuous functions, and delineate the basic properties of computable open and closed sets.
openaire +3 more sources
Characterization of the Computable Real Numbers by Means of Primitive Recursive Functions
2001One usually defines the notion of a computable real number by using recursive functions. However, there is a simple way due to A. Mostowski to characterize the computable real numbers by using only primitive recursive functions.We prove Mostowski's result differently and apply it to get other simple characterizations of this kind.
openaire +1 more source
ISA Transactions
Hand-held robotic instruments enhance precision in microsurgery by mitigating physiological tremor in real time. Current tremor filtering algorithms in these instruments often employ nonlinear phase prefilters to isolate the tremor signal. However, these filters introduce phase distortion in the filtered tremor, compromising accuracy. Although improved
Asad Rasheed +3 more
openaire +2 more sources
Hand-held robotic instruments enhance precision in microsurgery by mitigating physiological tremor in real time. Current tremor filtering algorithms in these instruments often employ nonlinear phase prefilters to isolate the tremor signal. However, these filters introduce phase distortion in the filtered tremor, compromising accuracy. Although improved
Asad Rasheed +3 more
openaire +2 more sources
Three simulations of Turing machines with the use of real recursive functions.
Ann. UMCS Informatica, 2004Artykuł z : Annales Universitatis Mariae Curie-Skłodowska, Sectio AI, Informatica, Vol. 2 (2004), s. 101-114 ; Artykuł z : Annales Universitatis Mariae Curie-Skłodowska, Sectio AI, Informatica, Vol. 2 (2004), s.
openaire +2 more sources

