Computability and Representations of the Zero Set | Zendy

Pieter Collins | Zendy

AI Assistant Blog Pricing

Home ZAIA Blog

Open Access

Computability and Representations of the Zero Set

Author(s) -

Pieter Collins

Publication year - 2008

Publication title -

electronic notes in theoretical computer science

Language(s) - English

Resource type - Journals

SCImago Journal Rank - 0.242

H-Index - 60

ISSN - 1571-0661

DOI - 10.1016/j.entcs.2008.12.005

Subject(s) - computability , representation (politics) , zero (linguistics) , mathematics , set (abstract data type) , zero set , cover (algebra) , computation , computable function , discrete mathematics , function (biology) , algebra over a field , theoretical computer science , pure mathematics , computer science , algorithm , programming language , mechanical engineering , linguistics , philosophy , evolutionary biology , politics , political science , law , biology , engineering

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

The content you want is available to Zendy users.

Already have an account? Click here to sign in.

Having issues? You can contact us here

Accelerating Research