10 research outputs found
Redundancy of information: lowering dimension
Let At denote the set of infinite sequences of effective dimension t. We
determine both how close and how far an infinite sequence of dimension s can be
from one of dimension t, measured using the Besicovitch pseudometric. We also
identify classes of sequences for which these infima and suprema are realized
as minima and maxima. When t < s, we find d(X,At) is minimized when X is a
Bernoulli p-random, where H(p)=s, and maximized when X belongs to a class of
infinite sequences that we call s-codewords. When s < t, the situation is
reversed.Comment: 28 pages, 3 figure
Descriptive Set Theory and Computable Topology (Dagstuhl Seminar 21461)
Computability and continuity are closely linked - in fact, continuity can be seen as computability relative to an arbitrary oracle. As such, concepts from topology and descriptive set theory feature heavily in the foundations of computable analysis. Conversely, techniques developed in computability theory can be fruitfully employed in topology and descriptive set theory, even if the desired results mention no computability at all. In this Dagstuhl Seminar, we brought together researchers from computable analysis, from classical computability theory, from descriptive set theory, formal topology, and other relevant areas. Our goals were to identify key open questions related to this interplay, to exploit synergies between the areas and to intensify collaboration between the relevant communities
S. Barry Cooper (1943-2015)
This article is an obituary in memoriam Barry Cooper (1943-2015