Effective local compactness and the hyperspace of located sets

03/13/2019
by   Arno Pauly, et al.
0

We revisit the definition of effective local compactness, and propose an approach that works for arbitrary countably-based spaces extending the previous work on computable metric spaces. We use this to show that effective local compactness suffices to ensure that the hyperspace of closed-and-overt sets (aka located sets, aka closed sets with full information) is computably compact and computably metrizable.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
10/29/2019

Effective Wadge Hierarchy in Computable Quasi-Polish Spaces

We define and study an effective version of the Wadge hierarchy in compu...
research
03/10/2018

On a metric generalization of the tt-degrees and effective dimension theory

In this article, we study an analogue of tt-reducibility for points in c...
research
03/05/2021

The intersection of algorithmically random closed sets and effective dimension

In this article, we study several aspects of the intersections of algori...
research
03/02/2023

Encoding of data sets and algorithms

In many high-impact applications, it is important to ensure the quality ...
research
01/31/2018

Dugundji systems and a retract characterization of effective zero-dimensionality

In a previous paper, the author considered several conditions for effect...
research
07/14/2021

A Granular Sieving Algorithm for Deterministic Global Optimization

A gradient-free deterministic method is developed to solve global optimi...
research
11/17/2022

Double Balanced Sets in High Dimensional Expanders

Recent works have shown that expansion of pseudorandom sets is of great ...

Please sign up or login with your details

Forgot password? Click here to reset