Complexity and real computation
Complexity and real computation
Computable analysis: an introduction
Computable analysis: an introduction
Formalisation of Computability of Operators and Real-Valued Functionals via Domain Theory
CCA '00 Selected Papers from the 4th International Workshop on Computability and Complexity in Analysis
Characteristic Properties of Majorant-Computability over the Reals
Proceedings of the 12th International Workshop on Computer Science Logic
Semantic Characterisations of Second-Order Computability over the Real Numbers
CSL '01 Proceedings of the 15th International Workshop on Computer Science Logic
The Uniformity Principle for Σ-Definability with Applications to Computable Analysis
CiE '07 Proceedings of the 3rd conference on Computability in Europe: Computation and Logic in the Real World
ΣK-constraints for hybrid systems
PSI'09 Proceedings of the 7th international Andrei Ershov Memorial conference on Perspectives of Systems Informatics
| Hi-index | 0.00 |
This paper extends the logical approach to computable analysis via Σ–definability to higher type continuous data such as functionals and operators. We employ definability theory to introduce computability of functionals from arbitrary domain to the real numbers. We show how this concept works in particular cases.