Abstract
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.
Cite
CITATION STYLE
Korovina, M. V., & Kudinov, O. V. (2001). Formalisation of computability of operators and real-valued functionals via domain theory. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 2064, pp. 146–168). Springer Verlag. https://doi.org/10.1007/3-540-45335-0_10
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
