Sciweavers

CIE
2005
Springer

Towards Computability of Higher Type Continuous Data

14 years 5 months ago
Towards Computability of Higher Type Continuous Data
Abstract. 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.
Margarita V. Korovina, Oleg V. Kudinov
Added 26 Jun 2010
Updated 26 Jun 2010
Type Conference
Year 2005
Where CIE
Authors Margarita V. Korovina, Oleg V. Kudinov
Comments (0)