Computable analysis: an introduction
Computable analysis: an introduction
Satisfiability of systems of equations of real analytic functions is quasi-decidable
MFCS'11 Proceedings of the 36th international conference on Mathematical foundations of computer science
| Hi-index | 0.00 |
In 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.