Computable analysis for systems and control
Dr Pieter Collins (CWI, The Netherlands)
A formal theory of computation of real-valued and set-valued functions
is important for the analysis and verification of nonlinear systems. In
this talk, I will discuss Weihrauch's type-two theory of effectivity, in
which Turing machines are used to functions on sequences. This provides
a natural setting for computable analysis and topology, in which the
computability and computation of operators on sets and maps can be
studied. After outlining the basics of the theory, I will apply the
techniques to discuss the computability of reachable, viable and
invariant sets.