Based on an effective theory of continuous domains, notions of computability for operators and real-valued functionals defined on the class of continuous functions are introduced. Definability and semantic characterisation of computable functionals are given. Also we propose a recursion scheme which is a suitable tool for formalisation of complex systems, such as hybrid systems. In this framework the trajectories of continuous parts of hybrid systems can be represented by computable functionals.
['Margarita V. Korovina', 'Oleg V. Kudinov']
Formalisation of computability of operators and real-valued functionals via domain theory