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.

Component cover representation, Computability, Index theory, Robust zero set
dx.doi.org/10.1016/j.entcs.2008.12.005
5th International Conference on Computability and Complexity in Analysis, CCA 2008
Centrum Wiskunde & Informatica, Amsterdam, The Netherlands

Collins, P.J. (2008). Computability and representations of the zero set. In Proceedings of the 5th International Conference on Computability and Complexity in Analysis, CCA 2008 (pp. 37–43). doi:10.1016/j.entcs.2008.12.005