Results 1 -
6 of
6
Infinite sets that admit fast exhaustive search
- In Proceedings of the 22nd Annual IEEE Symposium on Logic In Computer Science
, 2007
"... Abstract. Perhaps surprisingly, there are infinite sets that admit mechanical exhaustive search in finite time. We investigate three related questions: What kinds of infinite sets admit mechanical exhaustive search in finite time? How do we systematically build such sets? How fast can exhaustive sea ..."
Abstract
-
Cited by 11 (6 self)
- Add to MetaCart
Abstract. Perhaps surprisingly, there are infinite sets that admit mechanical exhaustive search in finite time. We investigate three related questions: What kinds of infinite sets admit mechanical exhaustive search in finite time? How do we systematically build such sets? How fast can exhaustive search over infinite sets be performed? Keywords. Higher-type computability and complexity, Kleene–Kreisel functionals, PCF, Haskell, topology. 1.
Computability of continuous solutions of higher-type equations
, 2009
"... 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 ..."
Abstract
-
Cited by 1 (1 self)
- Add to MetaCart
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: 2 X → 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. Our development includes a discussion of the generality of our constructions, bringing QCB spaces into the picture, in addition to general topological considerations. Keywords and phrases. Higher-type computability, Kleene–Kreisel spaces of continuous functionals, exhaustible set, searchable set, QCB space, admissible representation, topology in the theory of computation with infinite objects. 1
Acknowledgments I am grateful for discussions with (in alphabetic order) Philipp Gerhardy,
, 2008
"... We are considering typed hierarchies of total, continuous functionals over base types that are complete, separable metric spaces. P. Urysohn [17, 18] constructed a complete, separable metric space U. One of the properties of U is that every other separable metric space can be isometrically embedded ..."
Abstract
- Add to MetaCart
We are considering typed hierarchies of total, continuous functionals over base types that are complete, separable metric spaces. P. Urysohn [17, 18] constructed a complete, separable metric space U. One of the properties of U is that every other separable metric space can be isometrically embedded into U. We discuss why U may be considered as the universal model of possibly infintary outputs of algorithms, and show that all our typed hierarchies may be topologically embedded, type by type, into the corresponding hierarchy over U. Restricting our base types to effective, separable Banach spaces, we also prove a density theorem and an effective embedding theorem. These are our main technical results.
A Note on Closed Subsets in Quasi-zero-dimensional Qcb-spaces (Extended Abstract)
"... Abstract. We introduce the notion of quasi-zero-dimensionality as a substitute for the notion of zero-dimensionality, motivated by the fact that the latter behaves badly in the realm of qcb-spaces. We prove that the category QZ of quasi-zero-dimensional qcb0-spaces is cartesian closed. Prominent exa ..."
Abstract
- Add to MetaCart
Abstract. We introduce the notion of quasi-zero-dimensionality as a substitute for the notion of zero-dimensionality, motivated by the fact that the latter behaves badly in the realm of qcb-spaces. We prove that the category QZ of quasi-zero-dimensional qcb0-spaces is cartesian closed. Prominent examples of spaces in QZ are the spaces in the sequential hierarchy of the Kleene-Kreisel continuous functionals. Moreover, we characterise some types of closed subsets of QZ-spaces in terms of their ability to allow extendability of continuous functions. These results are related to an open problem in Computable Analysis.
in a higher-type setting
"... We show that, in a fairly general setting including higher-types, may, must and probabilistic testing are semidecidable. The case of must testing is perhaps surprising, as its mathematical definition involves universal quantification over the infinity of possible outcomes of a non-deterministic prog ..."
Abstract
- Add to MetaCart
We show that, in a fairly general setting including higher-types, may, must and probabilistic testing are semidecidable. The case of must testing is perhaps surprising, as its mathematical definition involves universal quantification over the infinity of possible outcomes of a non-deterministic program. The other two involve existential quantification and integration. We also perform first steps towards the semi-decidability of similar tests under the simultaneous presence of non-deterministic and probabilistic choice. Keywords: Non-deterministic and probabilistic computation, higher-type computability theory and exhaustible sets, may and must testing, operational and denotational semantics, powerdomains. 1
Algorithmic solution of higher-type equations
, 2011
"... In recent work we developed the notion of exhaustible set as a higher-type computational counter-part of the topological notion of compact set. In this paper we give applications to the computation of solutions of higher-type equations. Given a continuous functional f: X → Y and y ∈ Y, we wish to co ..."
Abstract
- Add to MetaCart
In recent work we developed the notion of exhaustible set as a higher-type computational counter-part of the topological notion of compact set. In this paper we give applications to the computation of solutions of higher-type equations. 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 exhaustibility condition. We also establish a version of this 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 evaluation functionals defined on compact spaces X of bounded sequences of Taylor coefficients with values on spaces Y of real analytic functions defined on a compact set. A corollary is that it is semi-decidable whether a function defined on such a compact set fails to be analytic, and that the Taylor coefficients of an analytic function can be computed extensionally from the function. Keywords and phrases. Higher-type computability, Kleene–Kreisel spaces of continuous functionals, exhaustible set, searchable set, computationally compact set, QCB space, admissible representation, topology in the theory of computation. 1

