2026-08-13T10:09:30Z https://drops.dagstuhl.de/oai

oai:drops-oai.dagstuhl.de:15929 2024-03-06T10:27:24Z ddc:004 open_access

Descriptive Set Theory and Computable Topology (Dagstuhl Seminar 21461) Hoyrup, Mathieu Pauly, Arno Selivanov, Victor Soskova, Mariya I. computable analysis enumeration degrees quasi-polish spaces synthetic topology 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. Schloss Dagstuhl – Leibniz-Zentrum für Informatik Mathieu Hoyrup and Arno Pauly and Victor Selivanov and Mariya I. Soskova 2022 Is Part Of Dagstuhl Reports, Volume 11, Issue 10 (2022) Article Text doc-type:ResearchArticle publishedVersion application/pdf doi:10.4230/DagRep.11.10.72 urn:nbn:de:0030-drops-159293 https://drops.dagstuhl.de/entities/document/10.4230/DagRep.11.10.72 eng https://creativecommons.org/licenses/by/4.0/legalcode