Add to ORKGA widely used approach to computability of real functions is the one in Grze-gorczyk’s style originating from [1]. This approach uses computable transfor-mations of infinitistic names of real numbers, as well as general quantifiers over these names. Other approaches allow avoiding the use of such names at least i
The basic motivation behind this work is to tie together various computational complexity classes, w...
Computation on the real numbers can be modelised in several different ways. There indeed exist a lot...
Computation on the real numbers can be modelised in several different ways. There indeed exist a lot...
The class of uniformly computable real functions with respect to a smallsubrecursive class of operat...
We present the different constructive definitions of real number that can be found in the literature...
AbstractWe present the different constructive definitions of real number that can be found in the li...
The aim of this thesis is to contribute to close the gap existing between the theory of computable a...
We introduce majorant computability of functions on reals. A structural theorem is proved, which con...
For any class F of total functions in the set N of the natural numbers, we define the notion of F-co...
In computable analysis, sequences of rational numbers which effectively converge to a real number x ...
A notable feature of the TTE approach to computability is the representationof the argument values a...
AbstractThis paper deals with the computability in analysis within the framework of Grzegorczyk's hi...
AbstractGiven a strictly increasing computable sequence (called a base sequence) of real numbers (wi...
We investigate interrelationships among different notions from mathematical analysis, effective topo...
AbstractIn recent years, there has been a considerable amount of work on using continuous domains in...
The basic motivation behind this work is to tie together various computational complexity classes, w...
Computation on the real numbers can be modelised in several different ways. There indeed exist a lot...
Computation on the real numbers can be modelised in several different ways. There indeed exist a lot...
The class of uniformly computable real functions with respect to a smallsubrecursive class of operat...
We present the different constructive definitions of real number that can be found in the literature...
AbstractWe present the different constructive definitions of real number that can be found in the li...
The aim of this thesis is to contribute to close the gap existing between the theory of computable a...
We introduce majorant computability of functions on reals. A structural theorem is proved, which con...
For any class F of total functions in the set N of the natural numbers, we define the notion of F-co...
In computable analysis, sequences of rational numbers which effectively converge to a real number x ...
A notable feature of the TTE approach to computability is the representationof the argument values a...
AbstractThis paper deals with the computability in analysis within the framework of Grzegorczyk's hi...
AbstractGiven a strictly increasing computable sequence (called a base sequence) of real numbers (wi...
We investigate interrelationships among different notions from mathematical analysis, effective topo...
AbstractIn recent years, there has been a considerable amount of work on using continuous domains in...
The basic motivation behind this work is to tie together various computational complexity classes, w...
Computation on the real numbers can be modelised in several different ways. There indeed exist a lot...
Computation on the real numbers can be modelised in several different ways. There indeed exist a lot...