AbstractΠ01 classes in a space X where X equals {0, 1}ω, ωω, [0, 1], or the real line real are given an effective enumeration Pe,X and the computably continuous functions are given an effective enumeration Fe,X. The notion of index sets associated with Π01 classes and with computably continuous functions is developed. The complexity of various problems of analysis is determined by the complexity of the associated index set
AbstractIn effective analysis, various classes of real numbers are discussed. For example, the class...
AbstractThe notions “recursively enumerable” and “recursive” are the basic notions of effectivity in...
AbstractThis paper deals with the computability in analysis within the framework of Grzegorczyk's hi...
AbstractA Π01 class is an effectively closed set of reals. We study properties of these classes dete...
Let $\le_{c}$ be computable reducibility on computably enumerable equivalence relations (or ceers). ...
AbstractIn this paper, we compare the computability and complexity of a continuous real function F w...
AbstractWe consider an abstract metric space with a computability structure and an effective separat...
AbstractIn this note we give a new representation for closed sets under which the robust zero set of...
AbstractIn this paper we study different approaches to computability over effectively enumerable top...
Computability and Complexity in Analysis (CCA) investigates the fundamental capabilities and limitat...
In this paper we study different approaches to computability over effectively enumerable topological...
Computable analysis has been well studied ever since Turing famously formalised the computable reals...
AbstractWe prove the following results: every recursively enumerable set approximated by finite sets...
htmlabstractIn this note we give a new representation for closed sets under which the robust zero se...
AbstractIn this paper ω-algebraic complete partial orders are considered the compact elements of whi...
AbstractIn effective analysis, various classes of real numbers are discussed. For example, the class...
AbstractThe notions “recursively enumerable” and “recursive” are the basic notions of effectivity in...
AbstractThis paper deals with the computability in analysis within the framework of Grzegorczyk's hi...
AbstractA Π01 class is an effectively closed set of reals. We study properties of these classes dete...
Let $\le_{c}$ be computable reducibility on computably enumerable equivalence relations (or ceers). ...
AbstractIn this paper, we compare the computability and complexity of a continuous real function F w...
AbstractWe consider an abstract metric space with a computability structure and an effective separat...
AbstractIn this note we give a new representation for closed sets under which the robust zero set of...
AbstractIn this paper we study different approaches to computability over effectively enumerable top...
Computability and Complexity in Analysis (CCA) investigates the fundamental capabilities and limitat...
In this paper we study different approaches to computability over effectively enumerable topological...
Computable analysis has been well studied ever since Turing famously formalised the computable reals...
AbstractWe prove the following results: every recursively enumerable set approximated by finite sets...
htmlabstractIn this note we give a new representation for closed sets under which the robust zero se...
AbstractIn this paper ω-algebraic complete partial orders are considered the compact elements of whi...
AbstractIn effective analysis, various classes of real numbers are discussed. For example, the class...
AbstractThe notions “recursively enumerable” and “recursive” are the basic notions of effectivity in...
AbstractThis paper deals with the computability in analysis within the framework of Grzegorczyk's hi...
DOI
Add to ORKG