Oberwolfach 2021 Workshop in Computability Theory Schedule Monday 09:15 CEST Ulrich Kohlenbach: Proof Mining in Nonconvex Optimization 10:15 CEST Nikolay Bazhenov: Bi-embeddable categoricity of computable structures 16:00 CEST Alberto Marcone: The Cantor-Bendixson theorem in the Weihrauch lattice 17:00 CEST Peter Cholak: Two Vignettes 19:30 CEST Theodore Slaman: Kolmogorov complexity and Capacitability of Dimension Tuesday 09:15 CEST Takayuki Kihara: HYP with finite mind-changes: On Kechris-Martin's theorem and a solution to Fournier's question 10:15 CEST Mars Yamaleev: On definability of c.e. degrees in the 2-c.e. degree structures 16:00 CEST Valentino Delle Rose: Relativized depth 17:00 CEST Russell Miller: Generic algebraic fields 19:30 CEST Open Questions Session Wednesday 09:15 CEST Lu Liu: The combinatorial equivalence of a computability theoretic question 10:15 CEST Vadim Puzarenko: On the "Heap" Problem 16:00 CEST Manlio Valenti: Ill-founded orders and Weihrauch degrees 17:00 CEST Valentina Harizanov: Densely Computable Structures 19:30 CEST Richard Shore: Almost Theorems of Hyperarithmetic Analysis Thursday 09:15 CEST Marat Faizrahmanov: On A-computable numberings 10:15 CEST Tomasz Steifer: Randomness relative to almost everything 16:00 CEST Matthias Schroeder: Effective Hausdorff spaces 17:00 CEST Denis Hirschfeldt: Coarse computability, the density metric, and Hausdorff distances between Turing degrees 19:30 CEST Mariya Soskova: PA relative to an enumeration oracle Friday 09:15 CEST Sasha Shen: Lines and planes: finite case 10:15 CEST Open questions