htmlabstractIn this note we give a new representation for closed sets under which the robust zero set of a function is computable. We call this representation the component cover representation. The computation of the zero set is based on topological index theory, the most powerful tool for finding robust solutions of equations
We revise and extend the foundation of computable topology in the framework of Type-2 theory of effe...
AbstractIn Computable Analysis each computable function is continuous and computably invariant, i.e....
A notable feature of the TTE approach to computability is the representationof the argument values a...
AbstractIn this note we give a new representation for closed sets under which the robust zero set of...
In this note we give a new representation for closed sets under which the robust zero set of a funct...
AbstractΠ01 classes in a space X where X equals {0, 1}ω, ωω, [0, 1], or the real line real are given...
The TTE approach to Computable Analysis is the study of so-calledrepresentations (encodings for cont...
AbstractThe empty set of course contains no computable point. On the other hand, surprising results ...
AbstractThe computation of reachable sets of nonlinear dynamic and control systems is an important p...
AbstractA concrete model of computation for a topological algebra is based on a representation of th...
textabstractThe computation of reachable sets of nonlinear dynamic and control systems is an importa...
The relationship between the structure of a domain and the complexity of computing over that domain ...
In this thesis, we explore connections between computability theory and set theory. We investigate a...
Abstract. We study perfectly locally computable structures, which are (possibly uncountable) structu...
A compact set has computable type if any homeomorphic copy of the set which is semicomputable is act...
We revise and extend the foundation of computable topology in the framework of Type-2 theory of effe...
AbstractIn Computable Analysis each computable function is continuous and computably invariant, i.e....
A notable feature of the TTE approach to computability is the representationof the argument values a...
AbstractIn this note we give a new representation for closed sets under which the robust zero set of...
In this note we give a new representation for closed sets under which the robust zero set of a funct...
AbstractΠ01 classes in a space X where X equals {0, 1}ω, ωω, [0, 1], or the real line real are given...
The TTE approach to Computable Analysis is the study of so-calledrepresentations (encodings for cont...
AbstractThe empty set of course contains no computable point. On the other hand, surprising results ...
AbstractThe computation of reachable sets of nonlinear dynamic and control systems is an important p...
AbstractA concrete model of computation for a topological algebra is based on a representation of th...
textabstractThe computation of reachable sets of nonlinear dynamic and control systems is an importa...
The relationship between the structure of a domain and the complexity of computing over that domain ...
In this thesis, we explore connections between computability theory and set theory. We investigate a...
Abstract. We study perfectly locally computable structures, which are (possibly uncountable) structu...
A compact set has computable type if any homeomorphic copy of the set which is semicomputable is act...
We revise and extend the foundation of computable topology in the framework of Type-2 theory of effe...
AbstractIn Computable Analysis each computable function is continuous and computably invariant, i.e....
A notable feature of the TTE approach to computability is the representationof the argument values a...
DOI
Add to ORKG