Abstract
We investigate the concept of generalised computability of operators and functionals defined on the set of continuous functions, firstly introduced in [9]. By working in the reals, with equality and without equality, we study properties of generalised computable operators and functionals. Also we propose interesting applications to formalisation of hybrid systems. We obtain some class of hybrid systems, which trajectories are computable in the sense of computable analysis. © Springer-Verlag Berlin Heidelberg 2001.
Cite
CITATION STYLE
Korovina, M. V., & Kudinov, O. V. (2001). Generalised computability and applications to hybrid systems. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 2244 LNCS, pp. 494–499). Springer Verlag. https://doi.org/10.1007/3-540-45575-2_47
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
