Computability of continuous solutions of higher-type equations

1Citations
Citations of this article
2Readers
Mendeley users who have this article in their library.
Get full text

Abstract

Given a continuous functional f: X → Y and y ∈ Y, we wish to compute x ∈ X such that f(x) = y, if such an x exists. We show that if x is unique and X and Y are subspaces of Kleene-Kreisel spaces of continuous functionals with X exhaustible, then x is computable uniformly in f, y and the exhaustion functional X: 2X → 2. We also establish a version of the above for computational metric spaces X and Y, where is X computationally complete and has an exhaustible set of Kleene-Kreisel representatives. Examples of interest include functionals defined on compact spaces X of analytic functions. © 2009 Springer Berlin Heidelberg.

Cite

CITATION STYLE

APA

Escardó, M. (2009). Computability of continuous solutions of higher-type equations. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 5635 LNCS, pp. 188–197). https://doi.org/10.1007/978-3-642-03073-4_20

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free