Results 231 to 240 of about 21,944 (260)

Real numbers and functions in the Kleene hierarchy and limits of recursive, rational functions

Journal of Symbolic Logic, 1969
Let ƒ 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.
Norman Shapiro
openalex   +2 more sources

Characterization of the Computable Real Numbers by Means of Primitive Recursive Functions

, 2001
One 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.
Dimiter Skordev
openalex   +2 more sources

Novel Range Functions via Taylor Expansions and Recursive Lagrange Interpolation with Application to Real Root Isolation

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
openalex   +2 more sources

Prediction of Recursive Real-Valued Functions from Finite Examples

, 2006
In 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, Kouichi Hirata, Tetsuhiro Miyahara   +2 more
openalex   +2 more sources

Computable Real‐Valued Functions on Recursive Open and Closed Subsets of Euclidean Space

Mathematical Logic Quarterly, 1996
AbstractIn 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. The paper concludes with a comprehensive
Qing Zhou
openalex   +3 more sources

Recursive Analysis Characterized as a Class of Real Recursive Functions

Fundam. Informaticae, 2006
Recently, 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 ...
Olivier Bournez, Emmanuel Hainry
openalex   +4 more sources

A VECTOR MATRIX REAL TIME RECURSIVE BACKPROPAGATION ALGORITHM FOR RECURRENT NEURAL NETWORKS THAT APPROXIMATE MULTI-VALUED PERIODIC FUNCTIONS

International Journal of Computational Intelligence and Applications, 2009
Unlike feedforward neural networks (FFNN) which can act as universal function approximators, recursive, or recurrent, neural networks can act as universal approximators for multi-valued functions. In this paper, a real time recursive backpropagation (RTRBP) algorithm in a vector matrix form is developed for a two-layer globally recursive neural ...
Peter Stubberud
openalex   +3 more sources

On a theory of computation over the real numbers; NP completeness, recursive functions and universal machines

[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 ...
Lenore Blum, M. Shub, Stephen T. Smale
openalex   +2 more sources

Computability of Continuous and Discontinuous Real Recursive Functions

, 2007

openalex   +2 more sources

Some of the next articles are maybe not open access.

Related searches:

Real-time and Recursive Estimators for Functional MRI Quality Assessment

Neuroinformatics, 2022
Real-time quality assessment (rtQA) of functional magnetic resonance imaging (fMRI) based on blood oxygen level-dependent (BOLD) signal changes is critical for neuroimaging research and clinical applications. The losses of BOLD sensitivity because of different types of technical and physiological noise remain major sources of fMRI artifacts.
Nikita Davydov, Lucas Peek, Tibor Auer, Evgeny Prilepin, Nicolas Gninenko, Dimitri Van De Ville, Artem V. Nikonorov, Yury Koush   +7 more
openaire   +2 more sources